JOURNAL ARTICLE
Minimal claw-free graphs
Peter DankelmannHenda C. SwartPaul van den BergWayne GoddardMichael D. Plummer
Year: 2008 Journal: Czechoslovak Mathematical Journal Vol: 58 (3)Pages: 787-798 Publisher: Springer Nature
Abstract
A graph G is a minimal claw-free graph (m.c.f. graph) if it contains no K 1,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.
Keywords:
Mathematics Combinatorics Claw Split graph Chordal graph Line graph Induced subgraph Discrete mathematics Graph Pathwidth Vertex (graph theory)
Metrics
1
Cited By
0.00
FWCI (Field Weighted Citation Impact)
10
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%
Topics
Advanced Graph Theory Research
Physical Sciences → Computer Science → Computational Theory and Mathematics
Interconnection Networks and Systems
Physical Sciences → Computer Science → Computer Networks and Communications
Complexity and Algorithms in Graphs
Physical Sciences → Computer Science → Computational Theory and Mathematics
Related Documents
JOURNAL ARTICLE
Claw-free minimal matching covered graphs
Yipei ZhangXiumei WangJinjiang YuanC.T. NgT.C.E. Cheng
Journal: Discrete Applied Mathematics Year: 2025 Vol: 370 Pages: 11-21
JOURNAL ARTICLE
Minimal 2-connected non-hamiltonian claw-free graphs
Journal: Discrete Mathematics Year: 1998 Vol: 191 (1-3)Pages: 57-64
JOURNAL ARTICLE
Quasi-claw-free graphs
Journal: Discrete Mathematics Year: 1998 Vol: 179 (1-3)Pages: 13-26
JOURNAL ARTICLE
Almost claw‐free graphs
Journal: Journal of Graph Theory Year: 1994 Vol: 18 (5)Pages: 469-477
JOURNAL ARTICLE
Equimatchable claw-free graphs
Saieed AkbariHadi AlizadehTınaz EkimDidem GözüpekMordechai Shalom
Journal: Discrete Mathematics Year: 2018 Vol: 341 (10)Pages: 2859-2871