Finding a \(\Delta\)-regular supergraph of minimum order

DOI10.1016/S0166-218X(02)00413-4zbMath1032.05068DBLPjournals/dam/BodlaenderTL03OpenAlexW2066999332WikidataQ59567881 ScholiaQ59567881MaRDI QIDQ1408809

Jan van Leeuwen, Hans L. Bodlaender, Richard B. Tan

Publication date: 25 September 2003

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00413-4

zbMATH Keywords

regular supergraphsregularizable

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

A partial refining of the Erdős-Kelly regulation ⋮ Editing graphs to satisfy degree constraints: a parameterized approach ⋮ Subgraphs of 4-regular planar graphs ⋮ Graph extensions, edit number and regular graphs ⋮ Graph editing problems with extended regularity constraints ⋮ Inducing regulation of any digraphs ⋮ Parameterized Graph Editing with Chosen Vertex Degrees

Cites Work

• Regular graphs containing a given graph
• An algorithmic proof of Tutte's f-factor theorem
• Unnamed Item

This page was built for publication: Finding a \(\Delta\)-regular supergraph of minimum order