On powers of circular arc graphs and proper circular arc graphs

DOI10.1016/0166-218X(95)00091-5zbMath0857.05030MaRDI QIDQ1923580

Carsten Flotow

Publication date: 26 February 1997

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

zbMATH Keywords

distancepowerdigraphstournamentscircular arc graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Distance-\(d\) independent set problems for bipartite and chordal graphs ⋮ Powers of geometric intersection graphs and dispersion algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On powers and centers of chordal graphs
• Distances in cocomparability graphs and their powers
• In-tournament digraphs
• On powers of \(m\)-trapezoid graphs
• Graphs whose powers are chordal and graphs whose powers are interval graphs
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
• An Efficient Test for Circular-Arc Graphs
• Efficient algorithms for interval graphs and circular-arc graphs
• A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs

This page was built for publication: On powers of circular arc graphs and proper circular arc graphs