A Berge-keeping operation for graphs

DOI10.1016/J.DISC.2005.12.041MaRDI QIDQ2433716zbMATH OpenOpenAlexFDO

Authors András Sebö

Publication date 30 October 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2005.12.041

zbMATH Keywords

Berge graphscolorationodd antiholeodd holeperfect graphsproperty-keeping operation (minor)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• scientific article; zbMATH DE number 1789914
• Odd pairs of cliques
• The strong perfect graph theorem
• Decomposing Berge graphs containing no proper wheel, long prism or their complements
• Berge trigraphs

Cites work

• A semi-strong perfect graph theorem
• scientific article; zbMATH DE number 3432293 (Why is no real title available?)
• On critical edges in minimal imperfect graphs
• Perfect zero–one matrices
• Recognizing Berge graphs
• Recognizing claw-free perfect graphs
• Recursive generation of partitionable graphs
• The connectivity of minimal imperfect graphs
• The strong perfect graph theorem

Cited in

(2)

• Graph operations preserving \(W_{2}\)-property
• Path Partitions, Cycle Covers and Integer Decomposition

This page was built for publication: A Berge-keeping operation for graphs

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