Line graphs containing 2-factors with bounded number of components

MaRDI QIDQ3119335zbMATH OpenFDO

Authors Hong-Jian Lai, Liming Xiong, Huiya Yan

Publication date 11 March 2019

zbMATH Keywords

2-factor\(k\)-supereulerian graphdominating Eulerian subgraphline graphreduced graph

Mathematics Subject Classification ID

Connectivity (05C40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• scientific article; zbMATH DE number 5307575
• 2-factors with the bounded number of components in line graphs
• scientific article; zbMATH DE number 5038486
• The upper bound of the number of cycles in a 2-factor of a line graph
• scientific article; zbMATH DE number 7021376

Cited in

(9)

• Graphs containing every 2-factor
• Even factors with a bounded number of components in iterated line graphs
• The upper bound of the number of cycles in a 2-factor of a line graph
• scientific article; zbMATH DE number 5307575 (Why is no real title available?)
• scientific article; zbMATH DE number 33169 (Why is no real title available?)
• scientific article; zbMATH DE number 7021376 (Why is no real title available?)
• scientific article; zbMATH DE number 5038486 (Why is no real title available?)
• 2-factors with the bounded number of components in line graphs
• Minimum number of components of 2-factors in iterated line graphs

This page was built for publication: Line graphs containing 2-factors with bounded number of components

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