Sciweavers

3204 search results - page 16 / 641
» The b-chromatic Number of a Graph
Sort
View
ALGORITHMICA
2011
13 years 2 months ago
Crossing Numbers of Graphs with Rotation Systems
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
Michael J. Pelsmajer, Marcus Schaefer, Daniel Stef...
DM
2008
91views more  DM 2008»
13 years 7 months ago
Lower bounds for the game colouring number of partial k-trees and planar graphs
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...
Jiaojiao Wu, Xuding Zhu
DM
2007
114views more  DM 2007»
13 years 7 months ago
An inequality for the group chromatic number of a graph
—We give an inequality for the group chromatic number of a graph as an extension of Brooks’ Theorem. Moreover, we obtain a structural theorem for graphs satisfying the equality...
Hong-Jian Lai, Xiangwen Li, Gexin Yu
ENDM
2007
91views more  ENDM 2007»
13 years 7 months ago
Game chromatic number of Cartesian product graphs
We find exact values for the game chromatic number of the Cartesian product graphs Sm Pn, Sm Cn, P2 Wn, and P2 Km,n. This extends previous results of Bartnicki et al. on the game...
Iztok Peterin
SWAT
2010
Springer
260views Algorithms» more  SWAT 2010»
14 years 18 days ago
Isomorphism for Graphs of Bounded Feedback Vertex Set Number
This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex de...
Stefan Kratsch, Pascal Schweitzer