Slender graphs

DOI10.1016/0095-8956(89)90022-1zbMath0634.05060OpenAlexW2913896380MaRDI QIDQ1096653

Alain Hertz

Publication date: 1989

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(89)90022-1

zbMATH Keywords

triangulated graphedge deletionarbitrary matchingslender graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Related Items (3)

Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance ⋮ Classes of perfect graphs ⋮ Skeletal graphs - a new class of perfect graphs

Cites Work

• A new property of critical imperfect graphs and some consequences
• Slim graphs
• On the perfect graph conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Slender graphs