8 search results - page 1 / 2 » Constructions for Cubic Graphs with Large Girth |
COMBINATORICS
1998
13 years 4 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
GC
2008
Springer
13 years 4 months ago
2008
Springer
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
DM
2010
13 years 5 months ago
2010
The chromatic capacity of a graph G; CAP (G) ; is the largest integer k such that there is a k-colouring of the edges of G such that when the vertices of G are coloured with the s...
CPC
2007
13 years 4 months ago
2007
In 1972, M. Rosenfeld asked if every triangle-free graph could be embedded in the unit sphere Sd in such a way that two vertices joined by an edge have distance more than √ 3 (i...
FSTTCS
2010
Springer
13 years 2 months ago
2010
Springer
In the Connected Dominating Set problem we are given as input a graph G and a positive integer k, and are asked if there is a set S of at most k vertices of G such that S is a dom...