Ptolemaic and chordal cover-incomparability graphs

DOI10.1007/s11083-021-09551-wOpenAlexW3139101777MaRDI QIDQ2140993

Manoj Changat, Arun Anil

Publication date: 23 May 2022

Published in: Order (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11083-021-09551-w

zbMATH Keywords

chordal graphsrecognition algorithmC-I graphsptolemaic

Mathematics Subject Classification ID

Order, lattices, ordered algebraic structures (06-XX)

Related Items (1)

Composition and product of cover-incomparability graphs

Cites Work

• Cover-incomparability graphs and chordal graphs
• On the complexity of cover-incomparability graphs of posets
• Cover-incomparability graphs of posets
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• Characterizing subclasses of cover-incomparability graphs by forbidden subposets
• Cographs which are cover-incomparability graphs of posets
• Which \(k\)-trees are cover-incomparability graphs?
• Which distance-hereditary graphs are cover-incomparability graphs?
• Ptolemaic and planar cover-incomparability graphs
• A characterization of ptolemaic graphs

This page was built for publication: Ptolemaic and chordal cover-incomparability graphs