Menthol
发表于 2025-3-21 16:14:39
书目名称Graph Theory in Paris影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0387957<br><br> <br><br>书目名称Graph Theory in Paris读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0387957<br><br> <br><br>
gratify
发表于 2025-3-21 22:36:02
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.
包裹
发表于 2025-3-22 03:43:11
https://doi.org/10.1057/9780230212800We give an O(.log log .+..)-time algorithm to recognize perfect circular-arc graphs.
BLANK
发表于 2025-3-22 07:36:45
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.
变形词
发表于 2025-3-22 10:18:36
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 ≤ ..
新义
发表于 2025-3-22 13:53:15
,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.
新义
发表于 2025-3-22 19:25:46
,-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
发表于 2025-3-22 21:13:08
http://reply.papertrans.cn/39/3880/387957/387957_8.png
Kernel
发表于 2025-3-23 04:10:33
http://reply.papertrans.cn/39/3880/387957/387957_9.png
残废的火焰
发表于 2025-3-23 05:33:51
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 ≤ ..