Sciweavers

1857 search results - page 10 / 372
» Minimum Degree Orderings
Sort
View
ISAAC
2009
Springer
133views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
Robert Franke, Ignaz Rutter, Dorothea Wagner
COMBINATORICS
2007
74views more  COMBINATORICS 2007»
14 years 11 months ago
Regular Spanning Subgraphs of Bipartite Graphs of High Minimum Degree
Let G be a simple balanced bipartite graph on 2n vertices, δ = δ(G)/n, and ρ0 = δ+ √ 2δ−1 2 . If δ ≥ 1/2 then G has a ρ0n -regular spanning subgraph. The statement is...
Béla Csaba
GC
2010
Springer
14 years 10 months ago
Pairs of Disjoint Dominating Sets and the Minimum Degree of Graphs
Christian Löwenstein, Dieter Rautenbach