Restricted circular-arc graphs and clique cycles
From MaRDI portal
Publication:1869213
DOI10.1016/S0012-365X(02)00578-2zbMath1017.05083MaRDI QIDQ1869213
Publication date: 9 April 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (6)
Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection ⋮ Proper circular arc graphs as intersection graphs of paths on a grid ⋮ Finding intersection models: from chordal to Helly circular-arc graphs ⋮ Normal Helly circular-arc graphs and its subclasses ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ Parameterized complexity of induced graph matching on claw-free graphs
This page was built for publication: Restricted circular-arc graphs and clique cycles
