Degree Sum Condition for k-ordered Hamiltonian Connected Graphs

2013 ◽  
Vol 31 (3) ◽  
pp. 743-755 ◽  
Author(s):  
Emlee W. Nicholson ◽  
Bing Wei
Keyword(s):  
Connected Graphs ◽  
Degree Sum ◽  
Hamiltonian Connected ◽  
Degree Sum Condition

scholarly journals Degree sum conditions for the circumference of 4-connected graphs

2014 ◽  
Vol 333 ◽  
pp. 66-83
Author(s):  
Shuya Chiba ◽  
Masao Tsugaki ◽  
Tomoki Yamashita
Keyword(s):  
Connected Graphs ◽  
Degree Sum

On a Sharp Degree Sum Condition for Disjoint Chorded Cycles in Graphs

2010 ◽  
Vol 26 (2) ◽  
pp. 173-186 ◽  
Author(s):  
Shuya Chiba ◽  
Shinya Fujita ◽  
Yunshu Gao ◽  
Guojun Li
Keyword(s):  
Degree Sum ◽  
Chorded Cycles ◽  
Degree Sum Condition

A note on locally connected and hamiltonian-connected graphs

1979 ◽  
Vol 33 (1) ◽  
pp. 5-8 ◽  
Author(s):  
Gary Chartrand ◽  
Ronald J. Gould ◽  
Albert D. Polimeni
Keyword(s):  
Connected Graphs ◽  
Hamiltonian Connected

Optimal Fault-Tolerant Hamiltonian and Hamiltonian Connected Graphs

2008 ◽  
Author(s):  
Y-Chuang Chen ◽  
Yong-Zen Huang ◽  
Lih-Hsing Hsu ◽  
Jimmy J. M. Tan ◽  
Theodore E. Simos ◽  
...  
Keyword(s):  
Fault Tolerant ◽  
Connected Graphs ◽  
Hamiltonian Connected

scholarly journals Vertex Degree Sums for Matchings in 3-Uniform Hypergraphs

10.37236/8627 ◽  
2019 ◽  
Vol 26 (4) ◽  
Author(s):  
Yi Zhang ◽  
Yi Zhao ◽  
Mei Lu
Keyword(s):  
Vertex Degree ◽  
Uniform Hypergraph ◽  
Degree Sum ◽  
Uniform Hypergraphs ◽  
Positive Integers ◽  
Degree Sum Condition

Let $n, s$ be positive integers such that $n$ is sufficiently large and $s\le n/3$. Suppose $H$ is a 3-uniform hypergraph of order $n$ without isolated vertices. If $\deg(u)+\deg(v) > 2(s-1)(n-1)$ for any two vertices $u$ and $v$ that are contained in some edge of $H$, then $H$ contains a matching of size $s$. This degree sum condition is best possible and confirms a conjecture of the authors [Electron. J. Combin. 25 (3), 2018], who proved the case when $s= n/3$.

scholarly journals Degree sum condition for the existence of spanning k-trees in star-free graphs

2019 ◽  
Author(s):  
Michitaka Furuya ◽  
Shun-ichi Maezawa ◽  
Ryota Matsubara ◽  
Haruhide Matsuda ◽  
Shoichi Tsuchiya ◽  
...  
Keyword(s):  
Degree Sum ◽  
Degree Sum Condition

scholarly journals Mutually orthogonal hamiltonian connected graphs

2009 ◽  
Vol 22 (9) ◽  
pp. 1429-1431 ◽  
Author(s):  
Tung-Yang Ho ◽  
Cheng-Kuan Lin ◽  
Jimmy J.M. Tan ◽  
Lih-Hsing Hsu
Keyword(s):  
Connected Graphs ◽  
Hamiltonian Connected
Sign in / Sign up

Export Citation Format

Share Document