Completeness for intersection classes

DOI10.1016/S0012-365X(97)00265-3zbMath0958.05097OpenAlexW1979367465MaRDI QIDQ1584399

Timothy B. Moorhouse, Derek Gordon 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

zbMATH Keywords

completenesschordal graphsintersection representationintersection class

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Interval graphs and related topics
• Intersection graphs of paths in a tree
• No antitwins in minimal imperfect graphs
• Graphical properties related to minimal imperfection
• The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs
• A characterisation of rigid circuit graphs
• A characterization of perfect graphs
• 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
• Families of graphs complete for the strong perfect graph Conjecture
• Coloring a Family of Circular Arcs
• The Strong Perfect Graph Conjecture for Planar Graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness for intersection classes