Representing graphs as the intersection of cographs and threshold graphs
From MaRDI portal
Publication:2040010
DOI10.37236/9110zbMath1467.05177arXiv2001.00798OpenAlexW3179270857MaRDI QIDQ2040010
Mathew C. Francis, Daphna Chacko
Publication date: 6 July 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2001.00798
Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitions of graphs into cographs
- Star coloring high girth planar graphs
- Interval representations of planar graphs
- On dimensional properties of graphs
- Complement reducible graphs
- On grid intersection graphs
- On acyclic colorings of planar graphs
- A partial k-arboretum of graphs with bounded treewidth
- Intersection dimensions of graph classes
- The four-colour theorem
- Coloring with no 2-colored \(P_4\)'s
- Algorithmic graph theory and perfect graphs
- Threshold graphs and related topics
- Intersection dimension and graph invariants
- Layered separators in minor-closed graph classes with applications
- Boxicity of series-parallel graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Boxicity and treewidth
- Star coloring of graphs
- On Symbolic Ultrametrics, Cotree Representations, and Cograph Edge Decompositions and Partitions
- Threshold Dimension of Graphs
- Star coloring planar graphs from small lists
- Star coloring bipartite planar graphs
- Star coloring of sparse graphs
- The Complexity of the Partial Order Dimension Problem
- Graph minors. II. Algorithmic aspects of tree-width
- Acyclic Colourings of Planar Graphs with Large Girth
- Split Graphs Having Dilworth Number Two
- Graph Classes: A Survey
- Boxicity and Poset Dimension
- The lexicographic method for the threshold cover problem
