On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.

DOI10.1016/S0012-365X(03)00248-6zbMath1041.05060MaRDI QIDQ1427474

Arne Hoffmann, Lutz Volkmann

Publication date: 14 March 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal graphs\(k\)-factor\([1k\)-factor]

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Graph factors and factorization: 1985--2003: a survey, On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory, On the maximum number of edges in a hypergraph with a unique perfect matching, On the size and structure of graphs with a constant number of 1-factors, On graphs with a unique perfect matching

Cites Work

• Unnamed Item
• Unnamed Item
• The maximum size of graphs with a unique \(k\)-factor
• Maximum graphs with a unique k-factor
• 1-Faktoren von Graphen. (1-factors of graphs)
• A note concerning graphs with unique f-factors
• Graphs with exactly one hamiltonian circuit
• On the structure of graphs with a uniquek-factor
• On the 1-factors of a non-separable graph
• On the structure of factorizable graphs
• The 1-Factors of Oriented Graphs