scientific article; zbMATH DE number 1496606

DOI10.1002/1097-0118(200007)34:3%3C204::AID-JGT2%3E3.0.CO;2-PMaRDI QIDQ4500707zbMATH OpenFDO

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

Publication date 23 January 2001

Full work available at URL https://doi.org/10.1002/1097-0118(200007)34:3%3C204::AID-JGT2%3E3.0.CO;2-P

zbMATH Keywords

\(\beta \)-perfect graphsgraph decompositionssignable graphs

Mathematics Subject Classification ID

Perfect graphs (05C17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 5917767
• Triangle-free graphs without forbidden subgraphs
• scientific article; zbMATH DE number 850231
• scientific article; zbMATH DE number 1208712
• On existentially complete triangle-free graphs
• Triangle-Free Hypergraphs
• scientific article; zbMATH DE number 2369587
• Triangles in graphs without bipartite suspensions
• Even-hole-free graphs: A survey
• Triply existentially complete triangle-free graphs

Cites work

• -perfect graphs
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• Corrigendum to: On the complexity of testing for odd holes and induced odd paths
• Decomposition of balanced matrices
• Even and odd holes in cap-free graphs
• On the complexity of testing for odd holes and induced odd paths
• Structural properties and decomposition of linear balanced matrices

Cited in

(15)

• Structure and algorithms for (cap, even hole)-free graphs
• A note on chromatic number of (cap, even hole)-free graphs
• A better upper bound on the chromatic number of (cap, even-hole)-free graphs
• A faster algorithm to recognize even-hole-free graphs
• Even-hole-free graphs. I: Decomposition theorem
• Even and odd holes in cap-free graphs
• A class of three-colorable triangle-free graphs
• A mickey-mouse decomposition theorem
• A faster algorithm to recognize even-hole-free graphs
• Finding a shortest even hole in polynomial time
• (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels
• (Theta, triangle)‐free and (even hole, K4)‐free graphs. Part 2: Bounds on treewidth
• Unavoidable induced subgraphs in graphs with complete bipartite induced minors
• (Even hole, triangle)-free graphs revisited
• Stable sets and graphs with no even holes

This page was built for publication:

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