Forests and trees among Gallai graphs

From MaRDI portal
Publication:472964

DOI10.1016/J.DISC.2014.09.003zbMATH Open1303.05165arXiv1312.3072OpenAlexW2041874779MaRDI QIDQ472964FDOQ472964

Dieter Rautenbach, Van Bang Le, Felix Joos

Publication date: 20 November 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: The Gallai graph Gamma(G) of a graph G has the edges of G as its vertices and two distinct vertices e and f of Gamma(G) are adjacent in Gamma(G) if the edges e and f of G are adjacent in G but do not span a triangle in G. Clearly, Gamma(G) is a subgraph of the line graph of G. While line graphs can be recognized efficiently the complexity of recognizing Gallai graphs is unknown. In the present paper we characterize those graphs whose Gallai graphs are forests or trees, respectively.


Full work available at URL: https://arxiv.org/abs/1312.3072




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Forests and trees among Gallai graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472964)