Slender graphs

DOI10.1016/0095-8956(89)90022-1MaRDI QIDQ1096653zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Slim graphs
• On slim graphs, even pairs, and star-cutsets
• A new characterization of trivially perfect graphs
• Slightly triangulated graphs are perfect
• Weakly triangulated graphs

Cites work

• scientific article; zbMATH DE number 3841894 (Why is no real title available?)
• scientific article; zbMATH DE number 3891424 (Why is no real title available?)
• scientific article; zbMATH DE number 3214398 (Why is no real title available?)
• A new property of critical imperfect graphs and some consequences
• On the perfect graph conjecture
• Slim graphs

Cited in

(6)

• On slim graphs, even pairs, and star-cutsets
• Skeletal graphs - a new class of perfect graphs
• Classes of graphs for which upper fractional domination equals independence, upper domination, and upper irredundance
• Classes of perfect graphs
• Thin strip graphs
• Slim graphs

This page was built for publication: Slender graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1096653)