๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Clique-transversal sets in 4-regular claw-free graphs

โœ Scribed by Er Fang Shan; Li Ying Kang

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2011
Tongue
English
Weight
212 KB
Volume
27
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Claw-free cubic graphs with clique-trans
Claw-free cubic graphs with clique-transversal number half of their order
โœ Erfang Shan; Haichao Wang ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 362 KB

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number, denoted by ฯ„ C (G), is the minimum cardinality of a cliquetransversal set in G. In 2008, we showed that the clique-transversal number of every clawfree cubic graph is

Longest cycles in regular 2-connected cl
Longest cycles in regular 2-connected claw-free graphs
โœ MingChu Li ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 884 KB

In this paper, we show that every 2-connected, k-regular claw-free graph on n vertices contains a cycle of length at least min {4k-2, n} (k >~ 8), and this result is best possible. ## I. Introduction All graphs considered here are undirected and finite, without loops or multiple edges. A graph G is

Hourglasses and Hamilton cycles in 4-con
Hourglasses and Hamilton cycles in 4-connected claw-free graphs
โœ Tomรกลก Kaiser; MingChu Li; Zdenฤ›k Ryjรกฤek; Liming Xiong ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 97 KB ๐Ÿ‘ 2 views

## Abstract We show that if __G__ is a 4โ€connected clawโ€free graph in which every induced hourglass subgraph __S__ contains two nonโ€adjacent vertices with a common neighbor outside __S__, then __G__ is hamiltonian. This extends the fact that 4โ€connected clawโ€free, hourglassโ€free graphs are hamilton