The multiplicity of 1-factors in total graphs
From MaRDI portal
DOI10.1016/0012-365X(88)90077-5zbMATH Open0678.05051MaRDI QIDQ1123908FDOQ1123908
Authors: George R. T. Hendry
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (05C99)
Cites Work
Cited In (8)
- On the number of (r,r+1)- factors in an (r,r+1)-factorization of a simple graph
- Title not available (Why is that?)
- The multiplicity of 1-factors in the square of a graph
- Title not available (Why is that?)
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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)