Non-edge orientation and vertex ordering characterizations of some classes of bigraphs

DOI10.1016/j.dam.2017.02.001zbMath1387.05216OpenAlexW2591998382MaRDI QIDQ1752498

Jing Huang

Publication date: 24 May 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.02.001

zbMATH Keywords

characterizationinterval bigraphvertex orderingchordal bigraphinterval containment bigraphnon-edge orientationpermutation bigraph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99) Ordered structures (06F99)

Related Items

Strong Cocomparability Graphs and Slash-Free Orderings of Matrices, Bipartite Analogues of Comparability and Cocomparability Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Max point-tolerance graphs
• Permutation bigraphs and interval containments
• On orthogonal ray graphs
• Two remarks on circular arc graphs
• Which claw-free graphs are perfectly orderable?
• On rigid circuit graphs
• Bipartite permutation graphs
• On opposition graphs, coalition graphs, and bipartite permutation graphs
• Representation characterizations of chordal bipartite graphs
• The LBFS Structure and Recognition of Interval Graphs
• Domination on Cocomparability Graphs
• Containment Graphs, Posets, and Related Classes of Graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Perfect Elimination and Chordal Bipartite Graphs
• Interval bigraphs and circular arc graphs
• Circular‐Arc Bigraphs and Its Subclasses
• Permutation Graphs and Transitive Graphs