Gallai-like characterization of strong cocomparability graphs

DOI10.1002/JGT.23113MaRDI QIDQ6595514zbMATH OpenFDO

Authors Jing Huang

Publication date 30 August 2024

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/JGT.23113

zbMATH Keywords

asteroidcocomparability graphcomparability graphedge-asteroidGallai-like characterizationpolynomial time recognition algorithmstrong cocomparability graphweak edge-asteroid

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
• Bipartite Analogues of Comparability and Cocomparability Graphs
• scientific article; zbMATH DE number 2044941
• Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs
• Linear Orderings of Subfamilies of AT‐Free Graphs

Cites work

• A Characterization of Comparability Graphs and of Interval Graphs
• Asteroidal Triple-Free Graphs
• Bipartite Analogues of Comparability and Cocomparability Graphs
• Characterizations of strongly chordal graphs
• Characterizations of totally balanced matrices
• Comparability graphs and intersection graphs
• Doubly Lexical Orderings of Matrices
• scientific article; zbMATH DE number 3172312 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3908482 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• scientific article; zbMATH DE number 6472574 (Why is no real title available?)
• Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
• Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
• List homomorphisms and circular arc graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Representation characterizations of chordal bipartite graphs
• Representation of a finite graph by a set of intervals on the real line
• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
• The complexity of comparability graph recognition and coloring
• The diameter of AT‐free graphs
• Totally-Balanced and Greedy Matrices
• Transitiv orientierbare Graphen
• Vertex ordering characterizations of graphs of bounded asteroidal number

Cited in

(1)

• Strong Cocomparability Graphs and Slash-Free Orderings of Matrices

This page was built for publication: Gallai-like characterization of strong cocomparability graphs

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