標(biāo)題: Titlebook: ; [打印本頁(yè)] 作者: Menthol 時(shí)間: 2025-3-21 16:14
書(shū)目名稱Graph Theory in Paris影響因子(影響力)
書(shū)目名稱Graph Theory in Paris影響因子(影響力)學(xué)科排名
書(shū)目名稱Graph Theory in Paris網(wǎng)絡(luò)公開(kāi)度
書(shū)目名稱Graph Theory in Paris網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書(shū)目名稱Graph Theory in Paris被引頻次
書(shū)目名稱Graph Theory in Paris被引頻次學(xué)科排名
書(shū)目名稱Graph Theory in Paris年度引用
書(shū)目名稱Graph Theory in Paris年度引用學(xué)科排名
書(shū)目名稱Graph Theory in Paris讀者反饋
書(shū)目名稱Graph Theory in Paris讀者反饋學(xué)科排名
作者: gratify 時(shí)間: 2025-3-21 22:36
Ralf Weinek?tter,Hermann GerickeWe consider simple connected graphs for which there is a path of length at least . between every pair of distinct vertices. We wish to show that in these graphs the cycle space over ?. is generated by the cycles of length at least ., where . = 1 for 3 ≤ . ≤ 6, . = 6/7 for . = 7, . ≥ 1/2 for . ≥ 8 and . ≤ 3/4 +.(1) for large k.作者: 包裹 時(shí)間: 2025-3-22 03:43
https://doi.org/10.1057/9780230212800We give an O(.log log .+..)-time algorithm to recognize perfect circular-arc graphs.作者: BLANK 時(shí)間: 2025-3-22 07:36
https://doi.org/10.1007/978-3-663-10811-5In this paper we consider the question of determining the maximum number of edges in a Hamiltonian graph of order . that contains no 2-factor with more than one cycle, that is, 2-factor Hamiltonian graphs. We obtain exact results for both bipartite graphs, and general graphs, and construct extremal graphs in each case.作者: 變形詞 時(shí)間: 2025-3-22 10:18
Missile Defences and Asian-Pacific SecurityIn this note we provide a Henneberg-type constructive characterization theorem of [.]-sparse graphs, that is, the graphs for which the number of induced edges in any subset . of nodes is at most .|.| ? .. We consider the case 0 ≤ l ≤ ..作者: 新義 時(shí)間: 2025-3-22 13:53
,Claude Berge — Sculptor of Graph Theory,Claude Berge fashioned graph theory into an integrated and significant part of modern mathematics. As was clear to all who met him, he was a multifaceted person, whose achievements, however varied they might seem at first glance, were interconnected in many ways.作者: 新義 時(shí)間: 2025-3-22 19:25
,-path-connectivity and ,-generation: an Upper Bound on ,,We consider simple connected graphs for which there is a path of length at least . between every pair of distinct vertices. We wish to show that in these graphs the cycle space over ?. is generated by the cycles of length at least ., where . = 1 for 3 ≤ . ≤ 6, . = 6/7 for . = 7, . ≥ 1/2 for . ≥ 8 and . ≤ 3/4 +.(1) for large k.作者: Preserve 時(shí)間: 2025-3-22 21:13 作者: Kernel 時(shí)間: 2025-3-23 04:10 作者: 殘廢的火焰 時(shí)間: 2025-3-23 05:33
A Note on [,]-sparse Graphs,In this note we provide a Henneberg-type constructive characterization theorem of [.]-sparse graphs, that is, the graphs for which the number of induced edges in any subset . of nodes is at most .|.| ? .. We consider the case 0 ≤ l ≤ ..作者: 圣人 時(shí)間: 2025-3-23 12:52 作者: CLEFT 時(shí)間: 2025-3-23 16:17 作者: 嬰兒 時(shí)間: 2025-3-23 20:38
Missile Guidance and Control Systemsrtices such that every chordless path joining them has even length. We prove that for every bull-reducible Berge graph . with at least two vertices, either . or its complementary graph . has an even pair.作者: Predigest 時(shí)間: 2025-3-23 23:43
https://doi.org/10.1007/978-1-4899-6427-4r a graph . is denoted by π(.). For instance, by the famous 1906 theorem of Thue, π(.) = 3 if . is a simple path with at least 4 vertices. This implies that π(.) ≤ 4 if Δ(.) ≤ 2. But how large can π(.) be for cubic graphs, .-trees, or planar graphs? This paper is a small survey of problems and results of the above type.作者: SAGE 時(shí)間: 2025-3-24 04:29 作者: endocardium 時(shí)間: 2025-3-24 08:49
Ratios of Some Domination Parameters in Graphs and Claw-free Graphs,er, the total domination number, the paired domination number, the double domination number and the independence number. We summarize the old and new results in a table and give for each bound examples of extremal families.作者: llibretto 時(shí)間: 2025-3-24 11:30
Even Pairs in Bull-reducible Graphs,rtices such that every chordless path joining them has even length. We prove that for every bull-reducible Berge graph . with at least two vertices, either . or its complementary graph . has an even pair.作者: 江湖郎中 時(shí)間: 2025-3-24 16:26
Nonrepetitive Graph Coloring,r a graph . is denoted by π(.). For instance, by the famous 1906 theorem of Thue, π(.) = 3 if . is a simple path with at least 4 vertices. This implies that π(.) ≤ 4 if Δ(.) ≤ 2. But how large can π(.) be for cubic graphs, .-trees, or planar graphs? This paper is a small survey of problems and results of the above type.作者: 投射 時(shí)間: 2025-3-24 21:21 作者: atrophy 時(shí)間: 2025-3-25 01:38 作者: 輕快走過(guò) 時(shí)間: 2025-3-25 04:12
Brambles, Prisms and Grids,e their tree-width bounded by an exponential function of .. Using brambles and their well-studied relation to tree-width, we show that they have in fact tree-width .(..). As a consequence, we obtain new bounds on the tree-width of graphs having no small grid as a minor.作者: –DOX 時(shí)間: 2025-3-25 10:24 作者: intimate 時(shí)間: 2025-3-25 14:37
Ratios of Some Domination Parameters in Graphs and Claw-free Graphs,er, the total domination number, the paired domination number, the double domination number and the independence number. We summarize the old and new results in a table and give for each bound examples of extremal families.作者: Vulvodynia 時(shí)間: 2025-3-25 18:55
Excessive Factorizations of Regular Graphs,egular graphs. We introduce two graph parameters related to excessive factorizations and show that their computation is NP-hard. We pose a number of questions regarding these parameters. We show that the size of an excessive factorization of a regular graph can exceed the degree of the graph by an a作者: Anthrp 時(shí)間: 2025-3-25 22:00 作者: 北極熊 時(shí)間: 2025-3-26 03:09
On Edge-maps whose Inverse Preserves Flows or Tensions, . if the pre-image of every cycle of . is a cycle of .. A fascinating conjecture of Jaeger asserts that every bridgeless graph has a cycle-continuous mapping to the Petersen graph. Jaeger showed that if this conjecture is true, then so is the 5-cycle-double-cover conjecture and the Fulkerson conjec作者: 無(wú)脊椎 時(shí)間: 2025-3-26 07:53 作者: hurricane 時(shí)間: 2025-3-26 08:28
Even Pairs in Bull-reducible Graphs,rtices such that every chordless path joining them has even length. We prove that for every bull-reducible Berge graph . with at least two vertices, either . or its complementary graph . has an even pair.作者: Corral 時(shí)間: 2025-3-26 14:07
Kernels in Orientations of Pretransitive Orientable Graphs,h that for every . ∈ . (.) ? . there exists an arc from . to .. A digraph . is called . (resp. left-pretransitive) when (.) ∈ .(.) and (.) ∈ .(.) implies (.) ∈ .(.) or (.) ∈ .(.) (resp. (.) ∈ .(.) and (.) ∈ .(.) implies (.) ∈ .(.) or (.) ∈ .(.)). These concepts were introduced by P. Duchet in 1980. 作者: Fsh238 時(shí)間: 2025-3-26 19:08
Nonrepetitive Graph Coloring,r a graph . is denoted by π(.). For instance, by the famous 1906 theorem of Thue, π(.) = 3 if . is a simple path with at least 4 vertices. This implies that π(.) ≤ 4 if Δ(.) ≤ 2. But how large can π(.) be for cubic graphs, .-trees, or planar graphs? This paper is a small survey of problems and resul作者: Arthropathy 時(shí)間: 2025-3-26 23:07 作者: Amorous 時(shí)間: 2025-3-27 04:50 作者: CRUE 時(shí)間: 2025-3-27 05:51
Independence Polynomials and the Unimodality Conjecture for Very Well-covered, Quasi-regularizable,t in .. [.] conjectured that .(., .) is unimodal for every tree ., while, in general, they proved that for each permutation . of 1, 2, ..., . there is a graph . with .(.) = . such that . . < . . < ... < . .. [.] conjectured that .(.; .) is unimodal for well-covered graphs. [.] provided examples of w作者: 逃避系列單詞 時(shí)間: 2025-3-27 10:27 作者: 不滿分子 時(shí)間: 2025-3-27 14:40 作者: Pastry 時(shí)間: 2025-3-27 21:29
https://doi.org/10.1057/9780230287372gligible, cells in Hex and the Shannon game..A cell is dead if the colour of any stone placed there is irrelevant to the theoretical outcome of the game. We show that dead cell recognition is NPcomplete for the Shannon game; we also introduce two broader classifications of ignorable cells and presen作者: Ostrich 時(shí)間: 2025-3-28 00:07
Misinformation and Disinformationer, the total domination number, the paired domination number, the double domination number and the independence number. We summarize the old and new results in a table and give for each bound examples of extremal families.作者: Intend 時(shí)間: 2025-3-28 06:08 作者: 鴿子 時(shí)間: 2025-3-28 09:20 作者: 橫截,橫斷 時(shí)間: 2025-3-28 12:44 作者: outer-ear 時(shí)間: 2025-3-28 17:11
https://doi.org/10.1007/978-3-8350-9611-0n problems for cographs admit polynomial time algorithms and forbidden induced subgraph characterizations, even for the list version of the problems. Cographs are the largest natural class of graphs that have been shown to have this property. We bound the size of a biggest minimal .obstruction cogra作者: 解決 時(shí)間: 2025-3-28 18:57 作者: ABOUT 時(shí)間: 2025-3-29 02:15
Missile and Space Projects Guide 1962h that for every . ∈ . (.) ? . there exists an arc from . to .. A digraph . is called . (resp. left-pretransitive) when (.) ∈ .(.) and (.) ∈ .(.) implies (.) ∈ .(.) or (.) ∈ .(.) (resp. (.) ∈ .(.) and (.) ∈ .(.) implies (.) ∈ .(.) or (.) ∈ .(.)). These concepts were introduced by P. Duchet in 1980. 作者: GLIB 時(shí)間: 2025-3-29 04:04
https://doi.org/10.1007/978-1-4899-6427-4r a graph . is denoted by π(.). For instance, by the famous 1906 theorem of Thue, π(.) = 3 if . is a simple path with at least 4 vertices. This implies that π(.) ≤ 4 if Δ(.) ≤ 2. But how large can π(.) be for cubic graphs, .-trees, or planar graphs? This paper is a small survey of problems and resul作者: 歌劇等 時(shí)間: 2025-3-29 09:03
https://doi.org/10.1007/978-1-4039-7854-7d in 1970 by M.D. Plummer who called such graphs well-covered. Whereas determining the independence number of an arbitrary graph is NP-complete, for a well-covered graph one can simply apply the greedy algorithm. A well-covered graph . is 1-well-covered if and only if, for every vertex . in ., . — .作者: 事情 時(shí)間: 2025-3-29 14:24
https://doi.org/10.1057/9780230233546est intersecting family . of independent .-subsets of .(.) may be obtained by taking all independent .-subsets containing some particular vertex..In this paper, we show that if . consists of one path . raised to the power .. ≥ 1, and . cycles .., .., ..., .. raised to the powers .., .., ..., .. resp作者: Ringworm 時(shí)間: 2025-3-29 17:35 作者: 的’ 時(shí)間: 2025-3-29 21:43
ower and upper bounds, functions of the order . of . and ⊕ ∈ ?, + ×, /. In 24 out of 48 cases simple bounds are obtained and proved by the system. In 21 more cases, the system provides bounds, 16 of which are proved by hand.作者: 絕種 時(shí)間: 2025-3-30 02:27 作者: 假設(shè) 時(shí)間: 2025-3-30 07:17 作者: 自愛(ài) 時(shí)間: 2025-3-30 10:37 作者: Cpr951 時(shí)間: 2025-3-30 14:38
Automated Results and Conjectures on Average Distance in Graphs,ower and upper bounds, functions of the order . of . and ⊕ ∈ ?, + ×, /. In 24 out of 48 cases simple bounds are obtained and proved by the system. In 21 more cases, the system provides bounds, 16 of which are proved by hand.作者: nutrients 時(shí)間: 2025-3-30 18:39 作者: Constant 時(shí)間: 2025-3-30 22:23 作者: Hot-Flash 時(shí)間: 2025-3-31 04:49 作者: VEIL 時(shí)間: 2025-3-31 08:58
https://doi.org/10.1007/978-3-662-28405-6rom . to .. The goal of this paper is to establish some basic structural properties of this (and other related) quasi-orders. For instance, we show that ? has antichains of arbitrarily large finite size. It appears to be an interesting question to determine if ? has an infinite antichain.作者: 滑稽 時(shí)間: 2025-3-31 11:32
On Edge-maps whose Inverse Preserves Flows or Tensions,rom . to .. The goal of this paper is to establish some basic structural properties of this (and other related) quasi-orders. For instance, we show that ? has antichains of arbitrarily large finite size. It appears to be an interesting question to determine if ? has an infinite antichain.作者: 烤架 時(shí)間: 2025-3-31 15:11
https://doi.org/10.1007/978-1-4039-7854-7 is also well covered and has the same independence number. The notion of a 1-well-covered graph was introduced by J. Staples in her 1975 dissertation and was further investigated by M. Pinter in 1991 and later. In this note the 1-well-covered graphs with no 4-cycles are characterized.作者: 大包裹 時(shí)間: 2025-3-31 20:00 作者: intercede 時(shí)間: 2025-3-31 23:50 作者: 美色花錢 時(shí)間: 2025-4-1 02:46 作者: 咒語(yǔ) 時(shí)間: 2025-4-1 08:52
