On an edge partition and root graphs of some classes of line graphs

DOI10.5614/ejgta.2017.5.1.12zbMath1471.05093OpenAlexW2606892216MaRDI QIDQ5006610

Pravas Karuvachery, Ambat 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

zbMATH Keywords

line graphanti-Gallai graphGallai graphroot graph

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the hardness of recognizing triangular line graphs
• Distance-hereditary graphs
• Two classes of perfect graphs
• Gallai graphs and anti-Gallai graphs
• Incidence matrices and interval graphs
• Gallai and anti-Gallai graphs of a graph
• Distance-Hereditary Graphs, Steiner Trees, and Connected Domination
• An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Transitiv orientierbare Graphen
• A textbook of graph theory

This page was built for publication: On an edge partition and root graphs of some classes of line graphs