The upper bound of the number of cycles in a 2-factor of a line graph

DOI10.1002/JGT.20220zbMATH Open1118.05049OpenAlexW4254224703MaRDI QIDQ3445503FDOQ3445503

Authors: Jun Fujisawa, Liming Xiong, Kiyoshi Yoshimoto, Shenggui 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

Recommendations

• scientific article; zbMATH DE number 1289749
• 2-factors with the bounded number of components in line graphs
• The number of cycles in 2-factors of cubic graphs
• The structure and existence of 2-factors in iterated line graphs
• Line graphs containing 2-factors with bounded number of components
• Even factors with a bounded number of components in iterated line graphs
• Minimum number of components of 2-factors in iterated line graphs
• scientific article; zbMATH DE number 7021376
• A new upper bound on extremal number of even cycles
• The existence of even factors in iterated line graphs

zbMATH Keywords

number of componentsline graph2-factor

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (14)

• On the 2-factor index of a graph
• Even subgraphs of bridgeless graphs and 2-factors of line graphs
• Title not available (Why is that?)
• Induced claws and existence of even factors of graphs
• Minimum number of components of 2-factors in iterated line graphs
• The structure of even factors in claw-free graphs
• Order of the largest Sachs subgraphs in graphs
• Line graphs containing 2-factors with bounded number of components
• 2-factors with the bounded number of components in line graphs
• Characterization of forbidden subgraphs for the existence of even factors in a graph
• The existence of even factors in iterated line graphs
• Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs
• Title not available (Why is that?)
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3445503)