Completeness for intersection classes
From MaRDI portal
Publication:1584399
DOI10.1016/S0012-365X(97)00265-3zbMATH Open0958.05097OpenAlexW1979367465MaRDI QIDQ1584399FDOQ1584399
Authors: Timothy B. Moorhouse, Derek G. Corneil
Publication date: 2 November 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(97)00265-3
Recommendations
Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)
Cites Work
- Intersection graphs of paths in a tree
- A characterization of perfect graphs
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Coloring a Family of Circular Arcs
- A characterisation of rigid circuit graphs
- The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
- The Strong Perfect Graph Conjecture for Planar Graphs
- Interval graphs and related topics
- Title not available (Why is that?)
- Graphical properties related to minimal imperfection
- No antitwins in minimal imperfect graphs
- Families of graphs complete for the strong perfect graph Conjecture
Cited In (7)
This page was built for publication: Completeness for intersection classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1584399)