A mickey-mouse decomposition theorem

DOI10.1007/3-540-59408-6_61zbMath1500.05023OpenAlexW1513284784MaRDI QIDQ5101425

Michele Conforti, Cornuéjols, Gérard, 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)

Related Items

Chair-free Berge graphs are perfect, Graphs of separability at most 2, 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

Cites Work

• Unnamed Item
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
• Normal hypergraphs and the perfect graph conjecture