A mickey-mouse decomposition theorem

DOI10.1007/3-540-59408-6_61MaRDI QIDQ5101425zbMATH OpenOpenAlexFDO

Authors Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vušković

Publication date 30 August 2022

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59408-6_61

zbMATH Keywords

perfect graph theoremscaling on a node

Mathematics Subject Classification ID

Perfect graphs (05C17) Signed and weighted graphs (05C22)

Recommendations

• scientific article; zbMATH DE number 1496606
• Even and odd holes in cap-free graphs
• Packing Odd Circuits
• Universally signable graphs
• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs

Cites work

• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
• scientific article; zbMATH DE number 3878985 (Why is no real title available?)
• Normal hypergraphs and the perfect graph conjecture

Cited in

(5)

• Chair-free Berge graphs are perfect
• Graphs without odd holes, parachutes or proper wheels: A generalization of Meyniel graphs and of line graphs of bipartite graphs
• Square-free perfect graphs.
• Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
• Graphs of separability at most 2

This page was built for publication: A mickey-mouse decomposition theorem

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