The Dilworth number of auto-chordal bipartite graphs
From MaRDI portal
Publication:497341
DOI10.1007/s00373-014-1471-8zbMath1327.05285arXiv1309.5787OpenAlexW2040040852MaRDI QIDQ497341
Andreas Brandstädt, Anne Berry, Konrad Engel
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5787
Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
The Dilworth number of auto-chordal bipartite graphs, On efficient domination for some classes of \(H\)-free bipartite graphs
Cites Work
- The Dilworth number of auto-chordal bipartite graphs
- Split graphs of Dilworth number 2
- Efficient graph representations
- Split permutation graphs
- Doubly lexical ordering of dense 0--1 matrices
- The Complexity of the Partial Order Dimension Problem
- Doubly Lexical Orderings of Matrices
- Three Partition Refinement Algorithms
- Split Graphs Having Dilworth Number Two
- Perfect Elimination and Chordal Bipartite Graphs
- Graph Classes: A Survey
- Dismantlable Lattices in the Mirror
- Unnamed Item
- Unnamed Item
- Unnamed Item