The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs

DOI10.1002/jgt.22415zbMath1411.05223OpenAlexW2898320738MaRDI QIDQ4632025

Valerio Boncompagni, Kristina Vušković, Marko Radovanović

Publication date: 25 April 2019

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22415

zbMATH Keywords

decompositionvertex coloringstructurerecognition algorithmclique cutsets2-amalgamsbisimplicial cutsets

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs of separability at most 2
• The three-in-a-tree problem
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• Alpha-balanced graphs and matrices and GF(3)-representability of matroids
• The ellipsoid method and its consequences in combinatorial optimization
• Universally signable graphs
• The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs
• Recognizing Berge graphs
• Vertex elimination orderings for hereditary graph classes
• Detecting wheels
• The world of hereditary graph classes viewed through Truemper configurations
• Algorithms for Square-3PC($\cdot, \cdot$)-Free Berge Graphs
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• Paths, Trees, and Flowers
• Algorithms for Perfectly Contractile Graphs

This page was built for publication: The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs