On graphs without a \(C_{4}\) or a diamond
From MaRDI portal
Publication:531598
DOI10.1016/j.dam.2010.04.015zbMath1213.05244OpenAlexW2144047548MaRDI QIDQ531598
Jeremy P. Spinrad, R. Sritharan, Elaine M. Eschen, Chính T. Hoàng
Publication date: 19 April 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.04.015
Related Items (14)
Map graphs having witnesses of large girth ⋮ Induced subgraph isomorphism: are some patterns substantially easier than others? ⋮ Essentially tight kernels for (weakly) closed graphs ⋮ Clique separator decomposition of hole-free and diamond-free graphs and algorithmic consequences ⋮ Finding Cliques in Social Networks: A New Distribution-Free Model ⋮ Unnamed Item ⋮ A Fast Deterministic Detection of Small Pattern Graphs in Graphs Without Large Cliques ⋮ Enumerations, forbidden subgraph characterizations, and the split-decomposition ⋮ A fast deterministic detection of small pattern graphs in graphs without large cliques ⋮ Decomposition of directed graphs and the Turán problem ⋮ A polynomial kernel for distance-hereditary vertex deletion ⋮ Detecting and enumerating small induced subgraphs in \(c\)-closed graphs ⋮ Rare siblings speed-up deterministic detection and counting of small pattern graphs ⋮ Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
Cites Work
- Unnamed Item
- Unnamed Item
- Matrix multiplication via arithmetic progressions
- On diameters and radii of bridged graphs
- Computing independent sets in graphs with large girth
- Efficient graph representations
- Algorithmic graph theory and perfect graphs
- A Linear Recognition Algorithm for Cographs
- Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
- Graph Classes: A Survey
This page was built for publication: On graphs without a \(C_{4}\) or a diamond
