G. Fertin, A. Raspaud, and B. Reed, On star coloring of graphs. In A. Branst adt and V. B. Le, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140-153, Springer, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
New Results in Graph Layout - Dujmovic, Wood (2003) (Correct)
....colouring of G is a vertex colouring with no bichromatic 4 vertex path; that is, each bichromatic subgraph is a forest of stars. The star chromatic number of G, denoted by # st (G) is the minimum number of colours in a star colouring of G. Acyclic and star colourings have been studied extensively [1 3, 16, 16 20, 52, 53, 63, 85, 86, 86, 99, 113]. By definition # a (G) # st (G) for every graph G. Conversely, if # a (G) c then # st (G) 53] The star chromatic number is bounded for a wide class of graphs. In particular, Nesetril and Ossona de Mendez [99] proved that every proper minor closed graph family has bounded star ....
....of G, denoted by # st (G) is the minimum number of colours in a star colouring of G. Acyclic and star colourings have been studied extensively [1 3, 16, 16 20, 52, 53, 63, 85, 86, 86, 99, 113] By definition # a (G) # st (G) for every graph G. Conversely, if # a (G) c then # st (G) [53]. The star chromatic number is bounded for a wide class of graphs. In particular, Nesetril and Ossona de Mendez [99] proved that every proper minor closed graph family has bounded star chromatic number. In fact, the star chromatic number of a graph G is at most a quadratic function of the maximum ....
[Article contains additional citation context not shown here]
G. FERTIN, A. RASPAUD, AND B. REED, On star coloring of graphs. In A. BRANST ADT AND V. B. LE, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140--153, Springer, 2001.
Three-Dimensional Grid Drawings with Sub-Quadratic Volume - Dujmovic, Wood (2003) (Correct)
....of a star and possibly some isolated vertices. The strong star chromatic number of a graph G, denoted by # sst (G) is the minimum number of colours in a strong star colouring of G. Note that star colourings, in which each bichromatic subgraph is a forest of stars, have also been studied (see [20, 34] for example) The star chromatic number of a graph G, denoted by # st (G) is the minimum number of colours in a star colouring of G. With an arbitrary order on each colour class in a strong star colouring, there is no X crossing. Thus track number tn(G) # sst (G) for every graph G, and ....
....have # m) strong star chromatic number. As far as the authors are aware, a # m) bound is not even known for star chromatic number. The best known bound in this direction is # st (G) 3 5 which can be proved in a similar fashion to Lemma 4, in conjunction with the result of Fertin et al. [20] that # st (G) # #20# (see [15] Acknowledgements Thanks to Stefan Langerman for stimulating discussions, and to Ferran Hurtado and Prosenjit Bose for graciously hosting the second author. ....
G. FERTIN, A. RASPAUD, AND B. REED, On star coloring of graphs. In A. BRANST ADT AND V. B. LE, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01) , vol. 2204 of Lecture Notes in Comput. Sci., pp. 140--153, Springer, 2001.
Star Colourings of Subdivisions - Wood (Correct)
....colouring of G is a star colouring if there is no bichromatic 4 vertex path; that is, each bichromatic subgraph is a union of disjoint stars. The star chromatic number of G, denoted by st (G) is the minimum number of colours in a star colouring of G. Star colourings have been investigated in [3 5, 8, 12] for example, and are closely related to acyclic colourings and oriented colourings of graphs. A general result by Nesetril School of Computer Science, Carleton University, Ottawa, Canada. Technical Report TR 2003 02. Research supported by NSERC. E mail: davidw scs.carleton.ca. 1 and Ossona de ....
G. FERTIN, A. RASPAUD, AND B. REED, On star coloring of graphs. In A. BRANST ADT AND V. B. LE, eds., Proc. 27th International Workshop on GraphTheoretic Concepts in Computer Science (WG '01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140--153, Springer, 2001.
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing - Wood (Correct)
....the star chromatic number of G, and is denoted by st (G) Nesetril and Ossona de Mendez [22] proved that every planar graph G has st (G) 30. Many other graph families have bounded star chromatic number, including graphs with bounded maximum degree [1] and graphs with bounded tree width [15]. In particular, Fertin et al. 15] proved that st (G) tw(G) tw(G) 3) 1. More generally, Nesetril and Ossona de Mendez [22] proved that G has bounded star chromatic number if and only if G is a member of a proper minor closed family of graphs. In this case, st (G) is at most a ....
....and is denoted by st (G) Nesetril and Ossona de Mendez [22] proved that every planar graph G has st (G) 30. Many other graph families have bounded star chromatic number, including graphs with bounded maximum degree [1] and graphs with bounded tree width [15] In particular, Fertin et al. [15] proved that st (G) tw(G) tw(G) 3) 1. More generally, Nesetril and Ossona de Mendez [22] proved that G has bounded star chromatic number if and only if G is a member of a proper minor closed family of graphs. In this case, st (G) is at most a quadratic function of the maximum ....
[Article contains additional citation context not shown here]
G. FERTIN, A. RASPAUD, AND B. REED, On star coloring of graphs. In A. BRANST ADT AND V. B. LE, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140--153, Springer, 2001.
Queue Layouts, Tree-Width, and Three-Dimensional Graph Drawing - Wood (2002) (Correct)
....the star chromatic number of G, and is denoted by st (G) Nesetril and Ossona de Mendez [18] proved that every planar graph G has st (G) 30. Many other graph families have bounded star chromatic number, including graphs with bounded maximum degree [1] and graphs with bounded treewidth [12]. In particular, Fertin et al. 12] proved that st (G) tw(G) tw(G) 3) 1. More generally, Nesetril and Ossona de Mendez [18] proved that G has bounded star chromatic number if and only if it is a member of a proper minor closed family of graphs. In this case, st (G) is at most a ....
....G, and is denoted by st (G) Nesetril and Ossona de Mendez [18] proved that every planar graph G has st (G) 30. Many other graph families have bounded star chromatic number, including graphs with bounded maximum degree [1] and graphs with bounded treewidth [12] In particular, Fertin et al. [12] proved that st (G) tw(G) tw(G) 3) 1. More generally, Nesetril and Ossona de Mendez [18] proved that G has bounded star chromatic number if and only if it is a member of a proper minor closed family of graphs. In this case, st (G) is at most a quadratic function of the maximum ....
[Article contains additional citation context not shown here]
G. FERTIN, A. RASPAUD, AND B. REED, On star coloring of graphs. In A. BRANST ADT AND V. B. LE, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140--153, Springer, 2001.
Acyclic, Star and Oriented Colourings of Graph Subdivisions - Wood (Correct)
No context found.
G. Fertin, A. Raspaud, and B. Reed, On star coloring of graphs. In A. Branst adt and V. B. Le, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140-153, Springer, 2001.
Coloring with no 2-colored P4's - Albertson, Chappell, al. (2004) (2 citations) (Correct)
No context found.
G. Fertin, A. Raspaud, B. Reed, On star coloring of graphs. in Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG
Layout of Graphs with Bounded Tree-Width - Dujmovic, Morin, Wood (2004) (Correct)
No context found.
G. Fertin, A. Raspaud, and B. Reed, On star coloring of graphs, in Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), A. Branstadt and V. B. Le, eds., vol. 2204 of Lecture Notes in Comput. Sci., Springer, 2001, pp. 140-153.
Coloring with no 2-colored P 4 's - Michael Albertson Smith (2004) (2 citations) (Correct)
No context found.
G. Fertin, A. Raspaud, B. Reed, On star coloring of graphs. in Graph-Theoretic Concepts in Computer Science, 27th International Workshop, WG
Track Layouts of Graphs - Dujmovic, Wood (2004) (Correct)
No context found.
G. FERTIN, A. RASPAUD, AND B. REED, On star coloring of graphs. In A. BRANST ADT AND V. B. LE, eds., Proc. 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '01), vol. 2204 of Lecture Notes in Comput. Sci., pp. 140--153, Springer, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC