On an edge partition and root graphs of some classes of line graphs
<p>The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets...
Main Authors: | K Pravas, A. Vijayakumar |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2017-04-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/263 |
Similar Items
-
A Gallai’s Theorem type result for the edge stability of graphs
by: Arnfried Kemnitz, et al.
Published: (2023-08-01) -
A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs
by: Colton Magnant
Published: (2018-01-01) -
A decomposition of gallai multigraphs
by: Halperin Alexander, et al.
Published: (2014-05-01) -
Weakened Gallai-Ramsey numbers
by: Gabrielle Beam, et al.
Published: (2018-08-01) -
Dense Arbitrarily Partitionable Graphs
by: Kalinowski Rafał, et al.
Published: (2016-02-01)