Sciweavers

1857 search results - page 21 / 372
» Minimum Degree Orderings
Sort
View
COCOON
2005
Springer
14 years 4 months ago
A Tight Analysis of the Maximal Matching Heuristic
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...
Jean Cardinal, Martine Labbé, Stefan Langer...
DM
2007
149views more  DM 2007»
13 years 10 months ago
Even subgraphs of bridgeless graphs and 2-factors of line graphs
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 ...
Bill Jackson, Kiyoshi Yoshimoto
SIAMDM
2010
91views more  SIAMDM 2010»
13 years 5 months ago
Embedding into Bipartite Graphs
Abstract. The conjecture of Bollob
Julia Böttcher, Peter Heinig, Anusch Taraz
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 10 months ago
Bounded-Degree Graphs have Arbitrarily Large Geometric Thickness
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...
János Barát, Jirí Matousek, D...
TCS
2008
13 years 10 months ago
Game chromatic index of graphs with given restrictions on degrees
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...
Andrew Beveridge, Tom Bohman, Alan M. Frieze, Oleg...