Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
From MaRDI portal
Publication:2457021
DOI10.1016/j.dam.2007.07.010zbMath1128.05036OpenAlexW1988129297MaRDI QIDQ2457021
Koichi Yamazaki, Yoshio Okamoto, Yota Otachi
Publication date: 29 October 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.07.010
Related Items (9)
Ferrers dimension of grid intersection graphs ⋮ On orthogonal ray graphs ⋮ Proper colorability of segment intersection graphs ⋮ On orthogonal ray trees ⋮ Chordal bipartite graphs with high boxicity ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ Jump Number of Two-Directional Orthogonal Ray Graphs ⋮ Simple Geometrical Intersection Graphs ⋮ Interval bigraphs are unit grid intersection graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Computing the boxicity of a graph by covering its complement by cointerval graphs
- Grid intersection graphs and boxicity
- On grid intersection graphs
- A special planar satisfiability problem and a consequence of its NP- completeness
- Recognizing interval digraphs and interval bigraphs in polynomial time
- Short proofs for interval digraphs
- Efficient graph representations
- The neighborhood characteristic parameter for graphs
- Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
- Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs
- Permuting matrices to avoid forbidden submatrices
- Representation of a finite graph by a set of intervals on the real line
- Doubly Lexical Orderings of Matrices
- Interval digraphs: An analogue of interval graphs
- Interval bigraphs and circular arc graphs
This page was built for publication: Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
