Titlebook: ;

Menthol

書(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

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.

包裹

https://doi.org/10.1057/9780230212800We give an O(.log log .+..)-time algorithm to recognize perfect circular-arc graphs.

BLANK

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.

變形詞

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 ≤ ..

新義

,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.

新義

,-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

Kernel

殘廢的火焰

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 ≤ ..