On opposition graphs, coalition graphs, and bipartite permutation graphs
From MaRDI portal
Publication:2442203
Recommendations
Cites work
- A translation of Gallai's paper: `Transitiv orientierbare Graphen'
- All variations on perfectly orderable graphs
- Bipartite permutation graphs
- Bipolarizable graphs
- Characterizations of totally balanced matrices
- Doubly Lexical Orderings of Matrices
- Efficient graph representations
- Efficient parallel algorithms for bipartite permutation graphs
- Graph Classes: A Survey
- On the complexity of recognizing a class of perfectly orderable graphs
- On the complexity of recognizing perfectly orderable graphs
- Perfectly orderable graphs: A survey
- Permuting matrices to avoid forbidden submatrices
- Recognition of some perfectly orderable graph classes
- Some classes of perfectly orderable graphs
- The strong perfect graph theorem
- Totally-Balanced and Greedy Matrices
- Transitiv orientierbare Graphen
- Which claw-free graphs are perfectly orderable?
Cited in
(4)
This page was built for publication: On opposition graphs, coalition graphs, and bipartite permutation graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2442203)