A nine vertex theorem for 3-connected claw- free graphs

Author： Gyõri Ervin   Plummer M. D.  

Publisher： Akademiai Kiado

ISSN： 0081-6906

Source： Studia Scientiarum Mathematicarum Hungarica, Vol.38, Iss.1-4, 2001-12, pp. : 233-244

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the Circumference of 3-Connected Quasi-Claw-Free Graphs

By Vumar Elkin  

Graphs and Combinatorics, Vol. 22, Iss. 2, 2006-06 ,pp. : 271-282

Springer Publishing Company

Access to resources Recommend Favorite

Hamiltonian Connected Claw-Free Graphs

By Li MingChu  

Graphs and Combinatorics, Vol. 20, Iss. 3, 2004-08 ,pp. : 341-362

Springer Publishing Company

Access to resources Recommend Favorite

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs

By Xu Jinquan   Li Ping   Miao Zhengke   Wang Keke   Lai Hong-Jian  

International Journal of Computer Mathematics, Vol. 91, Iss. 8, 2014-08 ,pp. : 1662-1672

Taylor & Francis Ltd

Access to resources Recommend Favorite

Total restrained domination in claw-free graphs

By Jiang Hongxing   Kang Liying  

Journal of Combinatorial Optimization, Vol. 19, Iss. 1, 2010-01 ,pp. : 60-68

Springer Publishing Company

Access to resources Recommend Favorite

Paired-domination in generalized claw-free graphs

By Dorbec Paul   Gravier Sylvain   Henning Michael  

Journal of Combinatorial Optimization, Vol. 14, Iss. 1, 2007-07 ,pp. : 1-7

Springer Publishing Company

Access to resources Recommend Favorite