Search Sciweavers | Sciweavers

265 search results - page 2 / 53

» The independence number in graphs of maximum degree three

click to vote

TCS
2008

108views Theoretical Computer Science» more TCS 2008»

Setting port numbers for fast graph exploration

13 years 4 months ago

Download www.labri.fr

We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...

David Ilcinkas

claim paper

Read More »

click to vote

DM
2008

85views more DM 2008»

All graphs with maximum degree three whose complements have 4-cycle decompositions

13 years 4 months ago

Download www.math.nctu.edu.tw

Let G be the set that contains precisely the graphs on n vertices with maximum degree 3 for which there exists a 4-cycle system of their complement in Kn. In this paper G is compl...

Chin-Mei Fu, Hung-Lin Fu, Christopher A. Rodger, T...

claim paper

Read More »

click to vote

CORR
2011
Springer

149views Education» more CORR 2011»

A new bound for parsimonious edge-colouring of graphs with maximum degree three

12 years 11 months ago

Download www.univ-orleans.fr

Jean-Luc Fouquet, Jean-Marie Vanherpe

claim paper

Read More »

click to vote

SODA
2010
ACM

234views Algorithms» more SODA 2010»

PTAS for maximum weight independent set problem with random weights in bounded degree graphs

14 years 2 months ago

Download siam.org

Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...

David Gamarnik, David Goldberg, Theophane Weber

claim paper

Read More »

click to vote

JGT
2007

76views more JGT 2007»

Total chromatic number of planar graphs with maximum degree ten

13 years 4 months ago

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers