Universally signable graphs

DOI10.1007/BF01196132zbMath0880.05028MaRDI QIDQ1375057

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

Publication date: 5 January 1998

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

universally signable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (14)

Hereditary Efficiently Dominatable Graphs ⋮ The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ The (theta, wheel)-free graphs. II: Structure theorem ⋮ Graphs of separability at most 2 ⋮ Theta-ring graphs, \(\mathrm{I}{{\mathcal{O}}} \)-compatibility and \(\Delta \)-matroids ⋮ On the forbidden induced subgraph sandwich problem ⋮ The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs ⋮ Graphs of Separability at Most Two: Structural Characterizations and Their Consequences ⋮ A Class of Three‐Colorable Triangle‐Free Graphs ⋮ Recognition of quasi-Meyniel graphs ⋮ Vertex elimination orderings for hereditary graph classes ⋮ Implosive graphs: Square-free monomials on symbolic Rees algebras ⋮ On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets ⋮ Well-covered and Cohen-Macaulay theta-ring graphs

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• On certain polytopes associated with graphs
• \(\beta\)-perfect graphs

This page was built for publication: Universally signable graphs