On chordal proper circular arc graphs

DOI10.1016/0012-365X(94)90130-9zbMath0796.05080OpenAlexW2006507202MaRDI QIDQ1322203

Jörgen Bang-Jensen, Pavol Hell

Publication date: 5 May 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90130-9

zbMATH Keywords

claw-free graphchordal graphproper interval graphproper circular arc graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Essential obstacles to Helly circular-arc graphs ⋮ Partial Characterizations of Circular-Arc Graphs ⋮ Structural results on circular-arc graphs and circle graphs: a survey and the main open problems ⋮ Unit interval editing is fixed-parameter tractable ⋮ An approximation result for a periodic allocation problem ⋮ Partial characterizations of circular-arc graphs ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey

Cites Work

• Locally semicomplete digraphs: A generalization of tournaments
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On chordal proper circular arc graphs