Greedy construction of nearly regular graphs

DOI10.1006/EUJC.1993.1025MaRDI QIDQ1260772zbMATH OpenOpenAlexFDO

Authors Ákos Seress, Gyula O. H. Katona

Publication date 25 August 1993

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/eujc.1993.1025

zbMATH Keywords

coloringdegreesfactormatchingnearly regular graphstree

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A randomized construction of high girth regular graphs
• scientific article; zbMATH DE number 5989950
• On a construction using commuting regular graphs
• On the construction of certain graphs
• scientific article; zbMATH DE number 1817540
• Recursive constructions of small regular graphs of given degree and girth
• scientific article; zbMATH DE number 1933248
• Greedy defining sets of graphs
• On constructing regular distance-preserving graphs
• Fast generation of regular graphs and construction of cages

Cited in

(1)

• Variants of k-regular nearest neighbor graph and their construction

This page was built for publication: Greedy construction of nearly regular graphs

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