Even cycles and even 2-factors in the line graph of a simple graph (Q2411500): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q676696 |
||
Property / author | |||
Property / author: Arrigo Bonisoli / rank | |||
Revision as of 15:59, 20 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Even cycles and even 2-factors in the line graph of a simple graph |
scientific article |
Statements
Even cycles and even 2-factors in the line graph of a simple graph (English)
0 references
24 October 2017
0 references
Summary: Let \(G\) be a connected graph with an even number of edges. We show that if the subgraph of \(G\) induced by the vertices of odd degree has a perfect matching, then the line graph of \(G\) has a \(2\)-factor whose connected components are cycles of even length (an even \(2\)-factor). For a cubic graph \(G\), we also give a necessary and sufficient condition so that the corresponding line graph \(L(G)\) has an even cycle decomposition of index \(3\), i.e., the edge-set of \(L(G)\) can be partitioned into three \(2\)-regular subgraphs whose connected components are cycles of even length. The more general problem of the existence of even cycle decompositions of index \(m\) in \(2d\)-regular graphs is also addressed.
0 references
cycle decomposition
0 references
2-factor
0 references
oriented graphs
0 references
line graph
0 references