Representation characterizations of chordal bipartite graphs
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3815694 (Why is no real title available?)
- scientific article; zbMATH DE number 3064989 (Why is no real title available?)
- A characterisation of rigid circuit graphs
- Bi‐arc graphs and the complexity of list homomorphisms
- Characterization problems for graphs, partially ordered sets, lattices, and families of sets
- Characterizations of strongly chordal graphs
- Characterizing circular-arc graphs
- Circular-arc graphs with clique cover number two
- Ferrers digraphs and threshold graphs
- Graph Classes: A Survey
- Incidence matrices and interval graphs
- Interval bigraphs and circular arc graphs
- Interval digraphs: An analogue of interval graphs
- List homomorphisms and circular arc graphs
- On rigid circuit graphs
- Perfect Elimination and Chordal Bipartite Graphs
- Representation of a finite graph by a set of intervals on the real line
- Representing digraphs using intervals or circular arcs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Triangulated graphs and the elimination process
- Two remarks on circular arc graphs
Cited in
(25)- Strong Chordality of Graphs with Possible Loops
- Lexicographic orientation algorithms
- Co-TT graphs and a characterization of split co-TT graphs
- Graph classes equivalent to 12-representable graphs
- Circular-arc bigraphs and its subclasses
- Min orderings and list homomorphism dichotomies for graphs and signed graphs
- Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
- Gallai-like characterization of strong cocomparability graphs
- Min-orderable digraphs
- Bipartite Analogues of Comparability and Cocomparability Graphs
- Chronological rectangle digraphs
- Recognition and characterization of chronological interval digraphs
- Interval-like graphs and digraphs
- Forbidden substructure for interval digraphs/bigraphs
- A characterization of line graphs of directed graphs
- 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
- Characterizing s-strongly chordal bipartite graphs
- A characterization of uniquely representable two-directional orthogonal ray graphs
- 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)
