Claw-free graphs. II. Non-orientable prismatic graphs
نویسندگان
چکیده
منابع مشابه
Claw-free graphs. II. Non-orientable prismatic graphs
A graph is prismatic if for every triangle T , every vertex not in T has exactly one neighbour in T . In a previous paper we gave a complete description of all 3-colourable prismatic graphs, and of a slightly more general class, the “orientable” prismatic graphs. In this paper we describe the non-orientable ones, thereby completing a description of all prismatic graphs. Since complements of pri...
متن کاملClaw-free graphs. I. Orientable prismatic graphs
A graph is prismatic if for every triangle T , every vertex not in T has exactly one neighbour in T . In this paper and the next in this series, we prove a structure theorem describing all prismatic graphs. This breaks into two cases depending whether the graph is 3-colourable or not, and in this paper we handle the 3-colourable case. (Indeed we handle a slight generalization of being 3-coloura...
متن کاملClaw-free Graphs VI. Colouring Claw-free Graphs
In this paper we prove that if G is a connected claw-free graph with three pairwise non-adjacent vertices, with chromatic number χ and clique number ω, then χ ≤ 2ω and the same for the complement of G. We also prove that the choice number of G is at most 2ω, except possibly in the case when G can be obtained from a subgraph of the Schläfli graph by replicating vertices. Finally, we show that th...
متن کاملEquimatchable Claw-Free Graphs
A graph is equimatchable if all of its maximal matchings have the same size. A graph is claw-free if it does not have a claw as an induced subgraph. In this paper, we provide, to the best of our knowledge, the first characterization of claw-free equimatchable graphs by identifying the equimatchable clawfree graph families. This characterization implies an efficient recognition algorithm.
متن کاملMinimal Claw-Free Graphs
A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K1,3 (claw) as an induced subgraph and if, for each edge e of G, G − e contains an induced claw. We investigate properties of m.c.f. graphs, establish sharp bounds on their orders and the degrees of their vertices, and characterize graphs which have m.c.f. line graphs. MSC 2000: 05C75, 05C07
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2008
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2007.06.006