Finding a -regular supergraph of minimum order
From MaRDI portal
Recommendations
- Supereulerian graphs with constraints on the matching number and minimum degree
- Super \(\lambda_3\)-optimality of regular graphs
- A note on minimum degree conditions for supereulerian graphs
- On the minimum common supergraph of two graphs
- The minimum order of n-connected n-regular graphs with specified diameters
- The superregular graphs
- Minimum order graphs with specified diameter, connectivity, and regularity
- On the super domination number of graphs
- Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
- scientific article; zbMATH DE number 5284228
Cites work
Cited in
(7)- Graph extensions, edit number and regular graphs
- A partial refining of the Erdős-Kelly regulation
- Parameterized Graph Editing with Chosen Vertex Degrees
- Editing graphs to satisfy degree constraints: a parameterized approach
- Inducing regulation of any digraphs
- Subgraphs of 4-regular planar graphs
- Graph editing problems with extended regularity constraints
This page was built for publication: Finding a \(\Delta\)-regular supergraph of minimum order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408809)