Circular permutation graphs

DOI10.1002/net.3230120407zbMath0508.05060OpenAlexW1971322036MaRDI QIDQ4745855

Jorge Urrutia, Doron Rotem

Publication date: 1982

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230120407

zbMATH Keywords

switchingcomparability graphspermutation graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (13)

Circular-arc graphs with clique cover number two ⋮ Angle orders, regular n-gon orders and the crossing number ⋮ Containment graphs and posets of paths in a tree: wheels and partial wheels ⋮ Partial and simultaneous transitive orientations via modular decompositions ⋮ Succinct permutation graphs ⋮ Algorithms and complexity of sandwich problems in graphs (extended abstract) ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ Switching to Hedgehog-Free Graphs Is NP-Complete ⋮ Separating objects in the plane by wedges and strips ⋮ On Switching to H‐Free Graphs ⋮ Circular permutation graph family with applications ⋮ Sorting by bounded block-moves ⋮ Modular decomposition and transitive orientation

Cites Work

• Unnamed Item
• Matrix characterizations of circular-arc graphs
• Transitive Orientation of Graphs and Identification of Permutation Graphs
• Permutation Graphs and Transitive Graphs
• A Characterization of Comparability Graphs and of Interval Graphs

This page was built for publication: Circular permutation graphs