派博傳思國(guó)際中心

標(biāo)題: Titlebook: Discrete Geometry, Combinatorics and Graph Theory; 7th China-Japan Conf Jin Akiyama,William Y. C. Chen,Qinglin Yu Conference proceedings 20 [打印本頁(yè)]

作者: Croching    時(shí)間: 2025-3-21 16:40
書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory影響因子(影響力)




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory被引頻次




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory被引頻次學(xué)科排名




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory年度引用




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory年度引用學(xué)科排名




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory讀者反饋




書(shū)目名稱(chēng)Discrete Geometry, Combinatorics and Graph Theory讀者反饋學(xué)科排名





作者: 敘述    時(shí)間: 2025-3-21 22:49
Supply Chain Management with SAP APO?), where .?=?. .?+?. .?+?. ., . .?≥?0, . .?≥?0, . .?≥?0 and . .?+?. .?+?. .?≥?1. We show that the plane can be subdivided into . disjoint convex polygons . such that every . . contains . red points and . blue points, every . . contains . red points and .?+?1 blue points and every . . contains .?+?1 red points and .?+?1 blue points.
作者: 混沌    時(shí)間: 2025-3-22 04:19
SCM Processes and SAP APO Modulesficient conditions respectively in the situations that the density function achieves its minimum value on a set with positive Lebesgue measure or at finitely many points. We propose also an economical scheme for the coverage of sensor networks with empirical distributions.
作者: BARK    時(shí)間: 2025-3-22 07:02

作者: 碎石    時(shí)間: 2025-3-22 08:50
Peter Schentler,Antje Krey,Martin Tschandlnteger satisfying ..?≤?.?≤?... We also find all corresponding integers .. and ... In addition, we prove that if . is the class of all connected cubic planar graphs of order 2. with decycling number . and ., then there exists a sequence of switchings .., .., ..., .. such that for every .?=?1, 2, ..., .???1, . and ..
作者: 系列    時(shí)間: 2025-3-22 15:03
Kurt Sandkuhl,Alexander Smirnov,Bengt Henoch to these weaker conditions mentioned above. In this paper, we study the relations among these different conditions. In particular, we prove that every triangularly connected claw-free graph without isolated vertices is also quasilocally connected claw-free.
作者: 系列    時(shí)間: 2025-3-22 19:21

作者: 繁忙    時(shí)間: 2025-3-23 01:18
On the Choice Numbers of Some Complete Multipartite Graphs,mplete (.?+?1)-partite graph . .. Using these, we determine the choice numbers for some complete multipartite graphs . .. As a byproduct, we classify (i) completely those complete tripartite graphs . . and (ii) almost completely those complete bipartite graphs . . (for .?≤?6) according to their choice numbers.
作者: 惡心    時(shí)間: 2025-3-23 04:44

作者: Interdict    時(shí)間: 2025-3-23 05:35
A Neighborhood Condition for Graphs to Have [,, ,]-Factors III,r any subgraph . of . with . edges and .(.???.(.))?≥?., . has an [., .]-factor . such that .(.)?∩?.(.)?=??. This result is best possible in some sense and it is an extension of the result of Matsuda (Discrete Mathematics . (2000) 289–292).
作者: 總    時(shí)間: 2025-3-23 13:42

作者: indoctrinate    時(shí)間: 2025-3-23 16:06
Coverage Problem of Wireless Sensor Networks,ficient conditions respectively in the situations that the density function achieves its minimum value on a set with positive Lebesgue measure or at finitely many points. We propose also an economical scheme for the coverage of sensor networks with empirical distributions.
作者: predict    時(shí)間: 2025-3-23 18:09

作者: 租約    時(shí)間: 2025-3-24 01:18
The Decycling Number of Cubic Planar Graphs,nteger satisfying ..?≤?.?≤?... We also find all corresponding integers .. and ... In addition, we prove that if . is the class of all connected cubic planar graphs of order 2. with decycling number . and ., then there exists a sequence of switchings .., .., ..., .. such that for every .?=?1, 2, ..., .???1, . and ..
作者: 關(guān)節(jié)炎    時(shí)間: 2025-3-24 05:16

作者: Cabg318    時(shí)間: 2025-3-24 06:31

作者: 匍匐前進(jìn)    時(shí)間: 2025-3-24 10:53
Benchmarking und empirische Ergebnissemplete (.?+?1)-partite graph . .. Using these, we determine the choice numbers for some complete multipartite graphs . .. As a byproduct, we classify (i) completely those complete tripartite graphs . . and (ii) almost completely those complete bipartite graphs . . (for .?≤?6) according to their choice numbers.
作者: 最小    時(shí)間: 2025-3-24 16:35
https://doi.org/10.1007/978-3-540-92942-0btain sufficient conditions of Hall-type and Tutte-type for the existence of perfect heterochromatic matchings in colored bipartite graphs and general colored graphs. We also obtain a sufficient and necessary condition of Berge-type to verify if a heterochromatic matching . of . is maximum.
作者: bleach    時(shí)間: 2025-3-24 20:21
Supply Chain Management Projects with APO] to . and to . respectively. In fact, in this paper we prove an upper bound of ., and with a long and unenlightening case analysis (over fifty cases!) we can improve the upper bound to ., for details see [9].
作者: 使糾纏    時(shí)間: 2025-3-24 23:48
Supply Chain Management with SAP APO?we must introduce other operations than cross-operation for transforming them by using only simple graphs. Then we naturally reach to a question: is there a sufficient set of operations for this purpose? For this problem, this paper shows a negative result that there is no such finite set of operations.
作者: admission    時(shí)間: 2025-3-25 04:37

作者: Ebct207    時(shí)間: 2025-3-25 08:46

作者: lethargy    時(shí)間: 2025-3-25 12:33
Zhiqiang Lu,Nathalie Bostel,Pierre Dejaxh properly rotating coordinate systems without increasing the number of orientation directions. We obtain the Steiner ratios with |.|?=?3 when rotation is allowed and some bounds of Steiner ratios for general case.
作者: chronology    時(shí)間: 2025-3-25 19:47
Sales and Operations Planning Optimisationhat it is a 2-connected graph being not a . if and only if .?∈?{10, 11, 14, 15, 16, 21, 22}. We also prove that, by discussing all the natural numbers except for 75 natural numbers, there are exactly 18 natural numbers, for each . of which, there exists a simple . graph on . vertices such that it is a 2-connected graph.
作者: 配置    時(shí)間: 2025-3-25 21:44

作者: Incompetent    時(shí)間: 2025-3-26 02:25

作者: Intrepid    時(shí)間: 2025-3-26 05:43

作者: endoscopy    時(shí)間: 2025-3-26 09:56
An Implicit Weighted Degree Condition for Heavy Cycles in Weighted Graphs, .(.) to denote the implicit weighted degree of a vertex . in .. In this paper we prove that . contains either a Hamilton cycle or a cycle of weight at least ., if the following two conditions are satisfied: (1) max {. .(.), . .(.)}?≥?./2 for each pair of nonadjacent vertices . and . that are vertic
作者: RLS898    時(shí)間: 2025-3-26 15:01
On the Choice Numbers of Some Complete Multipartite Graphs,s. if it admits a list coloring for every list assignment . with |.(.)|?=?.. The . of . is the minimum . such that . is .-choosable. We generalize a result (of [4]) concerning the choice numbers of complete bipartite graphs and prove some uniqueness results concerning the list colorability of the co
作者: 越自我    時(shí)間: 2025-3-26 18:02
On Convex Quadrangulations of Point Sets on the Plane,ls such that their vertices are elements of .., and no element of .. lies in the interior of any quadrilateral. It is straightforward to see that if . admits a quadrilaterization, its convex hull must have an even number of vertices. In [6] it was proved that if the convex hull of .. has an even num
作者: craven    時(shí)間: 2025-3-26 22:40
Sufficient Conditions for the Existence of Perfect Heterochromatic Matchings in Colored Graphs,ngs for which the maximum matching problem is solvable in polynomial time, the maximum heterochromatic matching problem is NP-complete. This means that to find both sufficient and necessary good conditions for the existence of perfect heterochromatic matchings should be not easy. In this paper, we o
作者: Exonerate    時(shí)間: 2025-3-27 02:23
Impossibility of Transformation of Vertex Labeled Simple Graphs Preserving the Cut-Size Order,be equivalent. From the equivalence, . precedes .′ in the order means that there is a sequence of cross-operations transforming . into .′. However, even if both graphs are simple, non-simple graphs may appear on the way of the transformation. If both graphs have the same number of edges, we conjectu
作者: 貧困    時(shí)間: 2025-3-27 06:59

作者: 連鎖    時(shí)間: 2025-3-27 11:25

作者: 手工藝品    時(shí)間: 2025-3-27 14:37

作者: 漂亮才會(huì)豪華    時(shí)間: 2025-3-27 21:00

作者: 繁忙    時(shí)間: 2025-3-28 01:47
Isolated Toughness and Existence of ,-Factors,; otherwise, set .(.)?=?|.(.)|???1. Let . and . be two nonnegative integer-valued functions defined on .(.) satisfying .?≤?.(.)?≤?.(.)?≤?. . The purpose in this paper are to present sufficient conditions in terms of the isolated toughness and the minimum degree for graphs to have .-factors and (., .
作者: heirloom    時(shí)間: 2025-3-28 05:14
A Note on the Integrity of Middle Graphs,and .(.???.) denote the the subset of . and the order of the largest component of .???., respectively. In this paper, we determine the integrity and some other parameters of middle graphs of some classes of graphs.
作者: 兇猛    時(shí)間: 2025-3-28 06:40
Indecomposable Coverings, any fixed concave quadrilateral, that cannot be decomposed into two coverings. We also construct, for every .?>?1, a set of points . and a family of disks . in the plane, each containing at least . elements of ., such that no matter how we color the points of . with two colors, there exists a disk
作者: 儲(chǔ)備    時(shí)間: 2025-3-28 14:10
The Decycling Number of Cubic Planar Graphs,ted cubic planar graphs of order 2. and ., then there exist integers .. and .. such that there exists a graph . with .(.)?=?. if and only if . is an integer satisfying ..?≤?.?≤?... We also find all corresponding integers .. and ... In addition, we prove that if . is the class of all connected cubic
作者: Instrumental    時(shí)間: 2025-3-28 18:16

作者: Champion    時(shí)間: 2025-3-28 20:36

作者: CRATE    時(shí)間: 2025-3-28 23:59
Two Classes of Simple MCD Graphs,ph .′ in .. with |.(.′)|?>?|.(.)|. A planar graph . is called a . (.) if .. formed by the following method is a path: corresponding to each interior face . of . (. is a plane graph of .) there is a vertex .. of ..; two vertices .. and .. are adjacent in .. if and only if the intersection of the boun
作者: custody    時(shí)間: 2025-3-29 05:16
Infinite Series of Generalized Gosper Space Filling Curves,the computer search and some geometrical insight, we conjecture that the degree . satisfies .?=?6.?+?1. We investigate the existence of infinite series of generalized Gosper curves. We show how to generate these series and introduce two new methods, the ‘decomposition method’ and the ‘modified layer method’.
作者: 消息靈通    時(shí)間: 2025-3-29 07:52
Hamiltonicity of Complements of Total Graphs,djacent or incident in .. In this paper, we show that the complement of total graph .(.) of a simple graph . is hamiltonian if and only if . is not isomorphic to any graph in {. .| .?≥?1}?∪?{. .?+?. .| .?≥?1}?∪?{. .?+?.| .?≥?2}?∪?{. .?+?2. ., . .?+?,. ., . .?+?2. ., . .}.
作者: Ossification    時(shí)間: 2025-3-29 14:18
A Note on the Integrity of Middle Graphs,and .(.???.) denote the the subset of . and the order of the largest component of .???., respectively. In this paper, we determine the integrity and some other parameters of middle graphs of some classes of graphs.
作者: 初次登臺(tái)    時(shí)間: 2025-3-29 17:21

作者: 包裹    時(shí)間: 2025-3-29 23:21

作者: 套索    時(shí)間: 2025-3-30 00:31
Supply Chain Management with SAP APO?In this paper some new results on edge coloring of graphs are introduced. This paper deals mainly with edge cover coloring, .-edge cover coloring, (., .)-coloring and equitable edge coloring. Some new problems and conjectures are presented.
作者: Ancillary    時(shí)間: 2025-3-30 07:14
Contractible Edges in a ,-Connected Graph,An edge of a .-connected graph is said to be .-contractible if the contraction of the edge results in a .-connected graph. Some results concerning .-contractible edges in a .-connected graph are presented.
作者: 平靜生活    時(shí)間: 2025-3-30 11:26
Some Topics on Edge-Coloring,In this paper some new results on edge coloring of graphs are introduced. This paper deals mainly with edge cover coloring, .-edge cover coloring, (., .)-coloring and equitable edge coloring. Some new problems and conjectures are presented.
作者: GULF    時(shí)間: 2025-3-30 13:40
Discrete Geometry, Combinatorics and Graph Theory978-3-540-70666-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
作者: inundate    時(shí)間: 2025-3-30 18:16
0302-9743 Overview: 978-3-540-70665-6978-3-540-70666-3Series ISSN 0302-9743 Series E-ISSN 1611-3349
作者: 多骨    時(shí)間: 2025-3-30 21:06

作者: 薄荷醇    時(shí)間: 2025-3-31 02:58
Christopher S. Tang,Kumar Rajaram,Jihong Oudjacent or incident in .. In this paper, we show that the complement of total graph .(.) of a simple graph . is hamiltonian if and only if . is not isomorphic to any graph in {. .| .?≥?1}?∪?{. .?+?. .| .?≥?1}?∪?{. .?+?.| .?≥?2}?∪?{. .?+?2. ., . .?+?,. ., . .?+?2. ., . .}.
作者: 含鐵    時(shí)間: 2025-3-31 07:26

作者: 咯咯笑    時(shí)間: 2025-3-31 12:00

作者: Vulvodynia    時(shí)間: 2025-3-31 16:30

作者: GUMP    時(shí)間: 2025-3-31 19:51
https://doi.org/10.1007/978-3-540-70666-3Graph; Graph theory; Sim; algorithm; algorithmic geometry; algorithms; combinatorial mathematics; computati
作者: 尖酸一點(diǎn)    時(shí)間: 2025-3-31 22:46
978-3-540-70665-6Springer-Verlag Berlin Heidelberg 2007
作者: 自戀    時(shí)間: 2025-4-1 03:01

作者: 抱怨    時(shí)間: 2025-4-1 06:37
Daniel Corsten,Christoph Gabriel .(.) to denote the implicit weighted degree of a vertex . in .. In this paper we prove that . contains either a Hamilton cycle or a cycle of weight at least ., if the following two conditions are satisfied: (1) max {. .(.), . .(.)}?≥?./2 for each pair of nonadjacent vertices . and . that are vertic
作者: 六邊形    時(shí)間: 2025-4-1 12:07
Benchmarking und empirische Ergebnisses. if it admits a list coloring for every list assignment . with |.(.)|?=?.. The . of . is the minimum . such that . is .-choosable. We generalize a result (of [4]) concerning the choice numbers of complete bipartite graphs and prove some uniqueness results concerning the list colorability of the co
作者: 不幸的人    時(shí)間: 2025-4-1 17:05

作者: Interdict    時(shí)間: 2025-4-1 20:15
https://doi.org/10.1007/978-3-540-92942-0ngs for which the maximum matching problem is solvable in polynomial time, the maximum heterochromatic matching problem is NP-complete. This means that to find both sufficient and necessary good conditions for the existence of perfect heterochromatic matchings should be not easy. In this paper, we o
作者: 爭(zhēng)論    時(shí)間: 2025-4-2 02:04
Supply Chain Management with SAP APO?be equivalent. From the equivalence, . precedes .′ in the order means that there is a sequence of cross-operations transforming . into .′. However, even if both graphs are simple, non-simple graphs may appear on the way of the transformation. If both graphs have the same number of edges, we conjectu
作者: GOAT    時(shí)間: 2025-4-2 04:32
https://doi.org/10.1007/978-3-540-92942-0>?(.?+?.)(.(.?+?.???1)???1)/. and |. .(. .)?∪?. .(. .)?∪???∪?. .(. .)|?≥?.|.|/(.?+?.) for every independent set { . ., . ., ..., . . }???.(.). Then for any subgraph . of . with . edges and .(.???.(.))?≥?., . has an [., .]-factor . such that .(.)?∩?.(.)?=??. This result is best possible in some sense
作者: 尊敬    時(shí)間: 2025-4-2 09:33
Supply Chain Management with SAP APO??≤?|.|?≤?(.?+?1)., .?≤?|.|?≤?(.?+?1).. Then without loss of generality, we can express |.|?=?.(. .?+?. .)?+?(.?+?1). .,? |.|?=?. .?+?(.?+?1)(. .?+?. .), where .?=?. .?+?. .?+?. ., . .?≥?0, . .?≥?0, . .?≥?0 and . .?+?. .?+?. .?≥?1. We show that the plane can be subdivided into . disjoint convex polyg
作者: 致詞    時(shí)間: 2025-4-2 12:55
SCM Processes and SAP APO Modulesmplete characterization of the coverage probability. For the sensor networks with non-uniform distributions, we derive two different necessary and sufficient conditions respectively in the situations that the density function achieves its minimum value on a set with positive Lebesgue measure or at f
作者: hair-bulb    時(shí)間: 2025-4-2 15:44





歡迎光臨 派博傳思國(guó)際中心 (http://www.pjsxioz.cn/) Powered by Discuz! X3.5
广河县| 云浮市| 巴林左旗| 通渭县| 桃源县| 石首市| 克什克腾旗| 苗栗市| 包头市| 紫云| 涿鹿县| 西乡县| 万山特区| 辽中县| 和林格尔县| 乐东| 寿光市| 阳春市| 文安县| 钟祥市| 互助| 台前县| 体育| 吉安县| 勐海县| 义乌市| 怀化市| 金秀| 潜山县| 高台县| 元氏县| 许昌市| 泰和县| 利津县| 罗甸县| 吴堡县| 自治县| 德令哈市| 融水| 南雄市| 洛扎县|