376 search results - page 20 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
166
click to vote
SIROCCO
2000
15 years 7 months ago
2000
A graph with n vertices and maximum degree cannot be given weak sense of direction using less than colours. It is known that n colours are always sufficient, but it has been conje...
135
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
To decide whether a line graph (hence a claw-free graph) of maximum degree five admits a stable cutset has been proven to be an NP-complete problem. The same result has been known...
164
click to vote
STOC
2000
ACM
15 years 10 months ago
2000
ACM
We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize ...
153
click to vote
CORR
2010
Springer
15 years 29 days ago
2010
Springer
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
151
click to vote
JGT
2007
15 years 5 months ago
2007
A well-known theorem of Mader [5] states that highly connected subgraphs can be forced in finite graphs by assuming a high minimum degree. Solving a problem of Diestel [2], we ex...