Circular permutation graphs

DOI10.1002/NET.3230120407MaRDI QIDQ4745855zbMATH OpenOpenAlexFDO

Authors Doron Rotem, J. Urrutia

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

switchingpermutation graphscomparability graphs

Mathematics Subject Classification ID

Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• A Characterization of Comparability Graphs and of Interval Graphs
• Matrix characterizations of circular-arc graphs
• Permutation Graphs and Transitive Graphs
• Transitive Orientation of Graphs and Identification of Permutation Graphs

Cited in

(15)

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

This page was built for publication: Circular permutation graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745855)