Recognition of chordal graphs and cographs which are cover-incomparability graphs

DOI10.46298/DMTCS.11657MaRDI QIDQ6986989zbMATH OpenFDO

Authors Arun Anil, Manoj Changat

Publication date 7 May 2025

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International

Full work available at URL https://doi.org/10.46298/DMTCS.11657

zbMATH Keywords

chordal graphcographscover-incomparability graphsrecognition algorithm

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorics of partially ordered sets (06A07)

Cites work

• A characterisation of rigid circuit graphs
• A Linear Recognition Algorithm for Cographs
• A simple linear time algorithm for cograph recognition
• A Simple Linear Time LexBFS Cograph Recognition Algorithm
• Algorithmic Aspects of Vertex Elimination on Graphs
• Characterizing subclasses of cover-incomparability graphs by forbidden subposets
• Cographs which are cover-incomparability graphs of posets
• Comparability graphs among cover-incomparability graphs
• Complement reducible graphs
• Composition and product of cover-incomparability graphs
• Cover-incomparability graphs and chordal graphs
• Cover-incomparability graphs of posets
• Efficient and practical algorithms for sequential modular decomposition
• scientific article; zbMATH DE number 1003286 (Why is no real title available?)
• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 1456953 (Why is no real title available?)
• Incidence matrices and interval graphs
• On a class of posets and the corresponding comparability graphs
• On a property of the class of n-colorable graphs
• On rigid circuit graphs
• On the complexity of cover-incomparability graphs of posets
• On the tree representation of chordal graphs
• Ptolemaic and chordal cover-incomparability graphs
• Ptolemaic and planar cover-incomparability graphs
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Transitiv orientierbare Graphen
• Which \(k\)-trees are cover-incomparability graphs?
• Which distance-hereditary graphs are cover-incomparability graphs?

This page was built for publication: Recognition of chordal graphs and cographs which are cover-incomparability graphs

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