Star Coloring of Graphs

Star Coloring of Graphs (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Guillaume Fertin , André Raspaud , Bruce Reed

Citations:

20 - 1 self

BibTeX

@MISC{Fertin01starcoloring,
    author = {Guillaume Fertin and André Raspaud and Bruce Reed},
    title = {Star Coloring of Graphs},
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

A star coloring of an undirected graph G is a proper vertex coloring of G (i.e., no two neighbors are assigned the same color) such that any path of length 3 in G is not bicolored. The star

Citations

1493	Random Graphs - Bollobas - 2001
234	Graph classes: a survey - Brandstadt, Le, et al. - 1999
98	Graph Minors. I: Excluding a Forest - Robertson, Seymour - 1983
73	On the total coloring of planar graphs - Borodin - 1989
55	Acyclic colorings of planar graphs - GRÜNBAUM - 1973
50	On an estimate of the chromatic class of a p-graph, Diskret - Vizing
41	The Four Color Problem - Ore - 1967
34	Topics in Intersection Graph Theory - McKee, McMorris - 1999
30	Acyclic coloring of graphs, Random Structures and Algorithms - ALON, MCDIARMID, et al. - 1991
16	Acyclic colourings of planar graphs with large girth - Borodin, Kostochka, et al. - 1999
13	Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network - Wan - 1997
9	R.: Cubic graphs - Greenlaw, Petreschi - 1995
8	A coloring problem on the n-cube - Kim, Du, et al.
3	Acyclic k-strong coloring of maps on surfaces - BORODIN, KOSTOCHKA, et al. - 2000
2	A partial k-arboretum of graphs with bounded treewidth - Bodlander - 1998
2	Colorings and Homomorphism of Minor Closed Classes - Nesetril, Mendez - 2002
1	Graph minors. 1. excluding a forest - Robertson, Seymour - 1983
1	In and sets. A. Hajnal et al - Erdos, Lovasz - 1975
1	Acyclic chromatic number of d-dimensional grids - Fertin, Godard, et al. - 2002