Slim graphs

DOI10.1007/BF01788666MaRDI QIDQ1123217zbMATH OpenOpenAlexFDO

Authors S. H. Smith

Publication date 1989

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01788666

zbMATH Keywords

locally perfect graphsMeyniel graphsSlim graphsstrong perfect graph conjecture

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Review text

The author investigates Slim graphs which can be obtained by deleting in a Meyniel graph G all the edges induced by an arbitrary set of nodes. Besides proving that Slim graphs are perfect a simple proof of the conjecture is given that Meyniel graphs are locally perfect graphs.

Recommendations

• On slim graphs, even pairs, and star-cutsets
• Progress on perfect graphs
• Slender graphs
• scientific article; zbMATH DE number 3884201
• On a conjecture of Meyniel

Cites work

• A new property of critical imperfect graphs and some consequences
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• Locally perfect graphs
• On a conjecture of Meyniel
• On the perfect graph conjecture
• Star-cutsets and perfect graphs

Cited in

(14)

• Graphs with small book thickness
• Slender graphs
• A note on perfect orders
• On slim graphs, even pairs, and star-cutsets
• Even and odd pairs in linegraphs of bipartite graphs
• On essential components and critical sets of a graph
• Classes of perfect graphs
• Thin strip graphs
• Characterisations and Linear-Time Recognition of Probe Cographs
• Precoloring Extension III: Classes of Perfect Graphs
• Slimness of graphs
• Skeletal graphs - a new class of perfect graphs
• On probe permutation graphs
• Precoloring extension of co-Meyniel graphs

This page was built for publication: Slim graphs

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