202 search results - page 3 / 41 » On the Queue Number of Planar Graphs |
CORR
2007
Springer
13 years 5 months ago
2007
Springer
A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest...
JCT
2008
13 years 5 months ago
2008
This paper introduces a new strategy for playing the marking game on graphs. Using this strategy, we prove that if G is a planar graph, then the game colouring number of G, and he...
JGT
2006
13 years 5 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
GD
2003
Springer
13 years 11 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
DM
2008
13 years 5 months ago
2008
This paper discusses the game colouring number of partial k-trees and planar graphs. Let colg(PT k) and colg(P) denote the maximum game colouring number of partial k trees and the...