Forests and trees among Gallai graphs
From MaRDI portal
Publication:472964
DOI10.1016/J.DISC.2014.09.003zbMath1303.05165arXiv1312.3072OpenAlexW2041874779MaRDI QIDQ472964
Dieter Rautenbach, Van Bang Le, Felix Joos
Publication date: 20 November 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.3072
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hardness of recognizing triangular line graphs
- Distance-hereditary graphs
- Recognizing claw-free perfect graphs
- Gallai graphs and anti-Gallai graphs
- A description of claw-free perfect graphs
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Gallai and anti-Gallai graphs of a graph
- The Dimension of Finite and Infinite Comparability Graphs
- A characterization of ptolemaic graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Transitiv orientierbare Graphen
This page was built for publication: Forests and trees among Gallai graphs