论文信息 - Finding a bigtriangleup-regular supergraph of minimum order

Finding a bigtriangleup-regular supergraph of minimum order

Akiyama et al. (Elem. Math. 83 (1983) 15) proved that every graph of maximum degree Δ is a subgraph of a Δ-regular graph that has at most Δ + 2 additional vertices. We show that, given a graph of maximum degree Δ, a Δ-regular supergraph of it of minimum order can be computed in O(min {Δ1.5|V|2.5, Δ6 + Δ|V|}) time.

[1] P. Erdös,et al. The Minimal Regular Graph Containing a Given Graph , 1963 .

[2] D. Koenig. Theorie Der Endlichen Und Unendlichen Graphen , 1965 .

[3] Harold N. Gabow,et al. An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

[4] Richard P. Anstee,et al. An Algorithmic Proof of Tutte's f-Factor Theorem , 1985, J. Algorithms.