Maximum graphs with a unique k-factor

DOI10.1016/0095-8956(84)90044-3zbMath0535.05036OpenAlexW2025895778MaRDI QIDQ790832

George R. T. Hendry

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90044-3

zbMATH Keywords

factorsTuran-problem

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 (6)

Spectral radius and \([a,b\)-factors in graphs] ⋮ 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 unique \(k\)-factors and unique \([1,k\)-factors in graphs.] ⋮ On graphs with a unique perfect matching ⋮ On the structure of graphs with a uniquek-factor

Cites Work

• Unnamed Item
• A census of maximum uniquely hamiltonian graphs
• Graphs with exactly one hamiltonian circuit
• On the 1-factors of a non-separable graph
• On the structure of factorizable graphs

This page was built for publication: Maximum graphs with a unique k-factor