The maximum size of graphs with a unique k-factor

DOI10.1007/S00493-004-0032-9zbMATH Open1058.05042OpenAlexW2018367070MaRDI QIDQ705753FDOQ705753

Authors: Lutz Volkmann 

Publication date: 14 February 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-004-0032-9

Recommendations

• On the structure of graphs with a uniquek-factor
• scientific article; zbMATH DE number 3961661
• On the structure of graphs with a unique \(k\)-factor
• Maximum graphs with a unique k-factor
• Publication:5750893

zbMATH Keywords

maximum sizeunique \(k\)-factor

Mathematics Subject Classification ID

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

Cited In (12)

• Title not available (Why is that?)
• Sizes and transmissions of digraphs with a given clique number
• Structural remarks on bipartite graphs with unique \(f\)-factors
• On unique \(k\)-factors and unique \([1,k]\)-factors in graphs.
• Extremal bipartite graphs with a unique k-factor
• On the structure of graphs with a uniquek-factor
• Title not available (Why is that?)
• On graphs with a unique perfect matching
• On the structure of graphs with a unique \(k\)-factor
• Maximum graphs with a unique k-factor
• On graphs that contain exactly \(k\) copies of a subgraph, and a related problem in search theory
• Title not available (Why is that?)

This page was built for publication: The maximum size of graphs with a unique \(k\)-factor

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