3204 search results - page 63 / 641 » The b-chromatic Number of a Graph |
110
click to vote
DM
2008
15 years 6 months ago
2008
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
182
click to vote
COMBINATORICS
2006
15 years 6 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that -----(u)(v) is an arc in H whenever...
150
click to vote
CORR
2007
Springer
15 years 5 months ago
2007
Springer
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely...
170
click to vote
JSYML
2010
15 years 21 days ago
2010
For automatic and recursive graphs, we investigate the following problems: (A) existence of a Hamiltonian path and existence of an infinite path in a tree (B) existence of an Euler...
147
click to vote
DM
2000
15 years 5 months ago
2000
Generalizing a result of Bodendiek and Burosch on graphs it is proved that every vertex-simple