The upper bound of the number of cycles in a 2-factor of a line graph
From MaRDI portal
Publication:3445503
DOI10.1002/JGT.20220zbMath1118.05049OpenAlexW4254224703MaRDI QIDQ3445503
Jun Fujisawa, Kiyoshi Yoshimoto, Limning Xiong, Sheng Gui Zhang
Publication date: 11 June 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20220
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (10)
Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs ⋮ 2-factors with the bounded number of components in line graphs ⋮ Order of the largest Sachs subgraphs in graphs ⋮ On the 2-factor index of a graph ⋮ Even subgraphs of bridgeless graphs and 2-factors of line graphs ⋮ Induced claws and existence of even factors of graphs ⋮ Characterization of forbidden subgraphs for the existence of even factors in a graph ⋮ The existence of even factors in iterated line graphs ⋮ The structure of even factors in claw-free graphs ⋮ Spanning subgraph with Eulerian components
This page was built for publication: The upper bound of the number of cycles in a 2-factor of a line graph
