The multiplicity of 1-factors in total graphs

DOI10.1016/0012-365X(88)90077-5MaRDI QIDQ1123908zbMATH OpenFDO

Authors George R. T. Hendry

Publication date 1988

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

total graph1-factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)

Recommendations

• The multiplicity of 1-factors in the square of a graph
• Counting 1-factors in infinite graphs
• scientific article; zbMATH DE number 749253
• On total covers of graphs
• Publication:3487420

Cites work

• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3412692 (Why is no real title available?)
• Graphs with 1-Factors
• The multiplicity of 1-factors in the square of a graph

Cited in

(8)

• On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
• scientific article; zbMATH DE number 749253 (Why is no real title available?)
• The multiplicity of 1-factors in the square of a graph
• scientific article; zbMATH DE number 6129517 (Why is no real title available?)
• On the number of edge-disjoint one factors and the existence of k-factors in complete multipartite graphs
• scientific article; zbMATH DE number 4055659 (Why is no real title available?)
• scientific article; zbMATH DE number 3900812 (Why is no real title available?)
• A generalization of Tutte's 1-factor theorem to countable graphs

This page was built for publication: The multiplicity of 1-factors in total graphs

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