Gallai-like characterization of strong cocomparability graphs
type: Item
instance of: scholarly article
title: Gallai-like characterization of strong cocomparability graphs
zbMATH Open document ID: 1546.05085
author: Jing Huang
published in: Journal of Graph Theory
publication date: 2024-08-30T00:00:00Z
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 7903749
zbMATH Keywords: asteroid
zbMATH Keywords: cocomparability graph
zbMATH Keywords: comparability graph
zbMATH Keywords: edge-asteroid
zbMATH Keywords: Gallai-like characterization
zbMATH Keywords: polynomial time recognition algorithm
zbMATH Keywords: strong cocomparability graph
zbMATH Keywords: weak edge-asteroid
MaRDI profile type: Publication
cites work: Characterizations of totally balanced matrices
cites work: Asteroidal Triple-Free Graphs
cites work: Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs
cites work: Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number
cites work: The diameter of AT‐free graphs
cites work: Characterizations of strongly chordal graphs
cites work: List homomorphisms and circular arc graphs
cites work: Transitiv orientierbare Graphen
cites work: Q3291037
cites work: A Characterization of Comparability Graphs and of Interval Graphs
cites work: The complexity of comparability graph recognition and coloring
cites work: Q3328583
cites work: Perfect Elimination and Chordal Bipartite Graphs
cites work: Comparability graphs and intersection graphs
cites work: Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
cites work: Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
cites work: Bipartite Analogues of Comparability and Cocomparability Graphs
cites work: Totally-Balanced and Greedy Matrices
cites work: Representation characterizations of chordal bipartite graphs
cites work: Representation of a finite graph by a set of intervals on the real line
cites work: Doubly Lexical Orderings of Matrices
cites work: Q5501778
cites work: Q3686754
cites work: Q4004146
DOI: 10.1002/JGT.23113
description: scientific article; zbMATH DE number 7903749