The structure and existence of 2-factors in iterated line graphs
Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke
Abstract
Open-access reader
Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke
Abstract
Open-access reader
We prove several results about the structure of 2-factors in iterated line graphs.Specifically, we give degree conditions on G that ensure L 2 (G) contains a 2-factor with every possible number of cycles, and we give a sufficient condition for the existence of a 2-factor in L 2 (G) with all cycle lengths specified.We also give a characterization of the graphs G where L k (G) contains a 2-factor.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We prove several results about the structure of 2-factors in iterated line graphs.Specifically, we give degree conditions on G that ensure L 2 (G) contains a 2-factor with every possible number of cycles, and we give a sufficient condition for the existence of a 2-factor in L 2 (G) with all cycle lengths specified.We also give a characterization of the graphs G where L k (G) contains a 2-factor.
Key concepts: Combinatorics, Mathematics, Iterated function, Line graph, Discrete mathematics, Hamiltonian path, Graph, Pancyclic graph