Representation characterizations of chordal bipartite graphs
From MaRDI portal
Publication:2498738
DOI10.1016/J.JCTB.2006.01.001zbMATH Open1095.05031OpenAlexW1975172784MaRDI QIDQ2498738FDOQ2498738
Authors: Jing Huang 
Publication date: 16 August 2006
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2006.01.001
Recommendations
- Several results on chordal bipartite graphs
- Interval bigraphs and circular arc graphs
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
- On cycle- and bi-cycle extendability in chordal and chordal bipartite graphs
characterizationstrongly chordal graphFerrers dimensionchordal bipartite graphinterval bigraphcircular arc graph
Cites Work
- Interval digraphs: An analogue of interval graphs
- Graph Classes: A Survey
- Incidence matrices and interval graphs
- On rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representation of a finite graph by a set of intervals on the real line
- Characterizations of strongly chordal graphs
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Triangulated graphs and the elimination process
- Title not available (Why is that?)
- Characterizing circular-arc graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Representing digraphs using intervals or circular arcs
- List homomorphisms and circular arc graphs
- Interval bigraphs and circular arc graphs
- Two remarks on circular arc graphs
- Bi‐arc graphs and the complexity of list homomorphisms
- A characterisation of rigid circuit graphs
- Circular-arc graphs with clique cover number two
- Title not available (Why is that?)
- Ferrers digraphs and threshold graphs
- Title not available (Why is that?)
Cited In (21)
- Lexicographic orientation algorithms
- Co-TT graphs and a characterization of split co-TT graphs
- Circular-arc bigraphs and its subclasses
- Min orderings and list homomorphism dichotomies for graphs and signed graphs
- Gallai-like characterization of strong cocomparability graphs
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Min-orderable digraphs
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Interval-like graphs and digraphs
- Chronological rectangle digraphs
- Recognition and characterization of chronological interval digraphs
- Forbidden substructure for interval digraphs/bigraphs
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices
- A generalization of Eagon–Reiner’s theorem and a characterization of bi-CMt bipartite and chordal graphs
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs
- The Dilworth number of auto-chordal bipartite graphs
- On the bi-enhancement of chordal-bipartite probe graphs
- Line graphs of directed graphs. I.
- Extending Partial Representations of Subclasses of Chordal Graphs
- Strong Chordality of Graphs with Possible Loops
- End-vertices of LBFS of (AT-free) bigraphs
This page was built for publication: Representation characterizations of chordal bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2498738)
