1857 search results - page 21 / 372 » Minimum Degree Orderings |
150
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...
150
click to vote
DM
2007
15 years 6 months ago
2007
By Petersen’s theorem, a bridgeless cubic multigraph has a 2-factor. H. Fleischner generalised this result to bridgeless multigraphs of minimum degree at least three by showing ...
173
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
147
click to vote
TCS
2008
15 years 6 months ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...