On an edge partition and root graphs of some classes of line graphs
From MaRDI portal
Publication:5006610
DOI10.5614/EJGTA.2017.5.1.12zbMATH Open1471.05093OpenAlexW2606892216MaRDI QIDQ5006610FDOQ5006610
Authors: Pravas Karuvachery, A. Vijayakumar
Publication date: 16 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2017.5.1.12
Recommendations
Cites Work
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Transitiv orientierbare Graphen
- A textbook of graph theory
- Distance-hereditary graphs
- Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
- Title not available (Why is that?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Gallai graphs and anti-Gallai graphs
- Gallai and anti-Gallai graphs of a graph
- On the hardness of recognizing triangular line graphs
- Two classes of perfect graphs
Cited In (2)
This page was built for publication: On an edge partition and root graphs of some classes of line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006610)