On the structure of certain intersection graphs

DOI10.1016/j.ipl.2006.01.013zbMath1184.05103OpenAlexW1982107102MaRDI QIDQ845675

Chính T. Hoàng, Kathie Cameron

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.01.013

zbMATH Keywords

chromatic numberperfect graphcomputational geometryintersection graphspolygon-circle graphgraph divisibilityinterval-filament graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum weight independent sets and cliques in intersection graphs of filaments
• The strong perfect graph theorem
• Star-cutsets and perfect graphs
• Comparability graphs and intersection graphs
• Thresholds for classes of intersection graphs
• Covering and coloring polygon-circle graphs
• Linear-time recognition of circular-arc graphs
• Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
• An Efficient Test for Circular-Arc Graphs
• Coloring a Family of Circular Arcs
• Graph Classes: A Survey
• Recognizing circle graphs in polynomial time
• $O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
• On the divisibility of graphs

This page was built for publication: On the structure of certain intersection graphs