A 1-factorization of the iterated line graphs of regular graphs

MaRDI QIDQ1801745zbMATH OpenFDO

Authors Guangfu Zhao

Publication date 17 August 1993

Published in Chinese Science Bulletin (Search for Journal in Brave)

zbMATH Keywords

1-factorizationcoloringline graphregular graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Review text

The author shows that the \(k\)-th iterated line graph \((k\geq 1)\) of a 1- factorizable graph is 1-factorizable iff it has an even number of vertices (which occurs if \(k\geq 2)\).

Recommendations

• Publication:3469130
• The structure and existence of 2-factors in iterated line graphs
• scientific article; zbMATH DE number 33169
• scientific article; zbMATH DE number 3918397
• The existence of even factors in iterated line graphs

Cited in

(4)

• Even factors with a bounded number of components in iterated line graphs
• scientific article; zbMATH DE number 4135990 (Why is no real title available?)
• The structure and existence of 2-factors in iterated line graphs
• The existence of even factors in iterated line graphs

This page was built for publication: A 1-factorization of the iterated line graphs of regular graphs

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