CiteSeer.IST Home  Related articles for:  Star Coloring of Graphs - Fertin, Raspaud, Reed (2001)   (Correct)

Active bibliography (related documents):
0.6:   Acyclic, Star and Oriented Colourings of Graph Subdivisions - Wood   (Correct)
0.6:   New Results in Graph Layout - Dujmovic, Wood (2003)   (Correct)
0.5:   Star Colourings of Subdivisions - Wood   (Correct)
0.5:   How Many Unit Equilateral Triangles Can Be Generated by n.. - Pach, Pinchasi   (Correct)
0.3:   Coloring with no 2-colored P4's - Albertson, Chappell, al. (2004)   (Correct)
0.2:   Graphs With Connected Medians - Bandelt, Chepoi (2002)   (Correct)
0.2:   Collective Tree Spanners of Graphs - Dragan, Yan, Lomonosov (2004)   (Correct)
0.2:   The Building Blocks of Complexity: A Unified Criterion and.. - Seese, Schlottmann (2003)   (Correct)
0.2:   Crossing graphs as joins of graphs and Cartesian products of.. - Bresar, Klavzar (2005)   (Correct)
0.2:   A Characterization of Easily Testable Induced Subgraphs - Alon, Shapira (2004)   (Correct)
0.2:   Tree Spanners for Bipartite Graphs and Probe Interval.. - Brandstädt, Dragan, Le, .. (2003)   (Correct)
0.2:   From Intervals to? Towards a General Description of.. - Kreinovich, Dimuro.. (2004)   (Correct)
0.1:   Layout of Graphs with Bounded Tree-Width - Dujmovic, Morin, Wood (2004)   (Correct)
0.1:   Coloring with no 2-colored P 4 's - Michael Albertson Smith (2004)   (Correct)
0.1:   Track Layouts of Graphs - Dujmovic, Wood (2004)   (Correct)
0.1:   Acyclic Improper Colourings of Graphs with Bounded Degree - Boiron, al. (1997)   (Correct)
0.1:   Acyclic Edge Colorings of Graphs - Alon, Sudakov, Zaks   (Correct)
0.1:   On Max Cut in Cubic Graphs - Calamoneri, Finocchi, Petreschi..   (Correct)
0.1:   Acyclic List 7-Coloring Of Planar Graphs - Borodin, Fon-Der Flaass, Kostochka (2001)   (Correct)
0.1:   Colorings and Girth of Oriented Planar Graphs - Nesetril, al. (1997)   (Correct)

Similar documents based on text:
0.4:   Recognizing Recursive Circulant Graphs G(cd m ,d) - Fertin, Raspaud   (Correct)
0.4:   Diameter of Knödel Graph - Fertin, Raspaud, Schröder, Sykora..   (Correct)
0.4:   A Survey on Knödel Graphs - Fertin, Raspaud   (Correct)
0.4:   k-Dominating Sets in Planar Graphs with Applications - Gavoille, Peleg, al. (2001)   (Correct)
0.4:   An Algebraic Approach to Heterogeneous Software Systems - Andre, Royer (2000)   (Correct)
0.3:   On Behavior of Interacting Agents - Dekhtyar, Dikovsky, Valiev (2002)   (Correct)
0.3:   Small k-Dominating Sets in Planar Graphs with Applications - Gavoille, Peleg, Raspaud, .. (2001)   (Correct)
0.3:   Acyclic Colourings of 1-Planar Graphs - Borodin, al. (1999)   (Correct)
0.3:   Building Executable Data Types from Dynamic Descriptions - André, Royer (1999)   (Correct)
0.3:   Acyclic Colouring of 1-Planar Graphs - Borodin, Kostochka, Raspaud, Sopena (1999)   (Correct)

System load high. Please wait...
Timeout. Please try your query later.
Related documents from co-citation:
9:   Colorings and homomorphisms of minor closed classes (context) - SET, DE MENDEZ - 2001
8:   Three-dimensional grid drawings of graphs - Pach, Thiele et al. - 1998
7:   Random Structures Algorithms (context) - Alon, Roichman - 1994
6:   Drawing series-parallel graphs on a box - DI GIACOMO, LIOTTA et al.
6:   Pathwidth and three-dimensional straight-line grid drawings of graphs (context) - DUJMOVI, MORIN et al.
6:   On acyclic colorings of planar graphs (context) - Borodin - 1979
6:   straight-line grid drawing of 4-colorable graphs (context) - CALAMONERI, STERBINI - 1997
6:   A new algorithm for drawing series-parallel digraphs in 3D (context) - PORANEN - 2000
6:   Comparing queues and stacks as mechanisms for laying out graphs (context) - Heath, Leighton et al. - 1992
6:   trees with applications in graph layout (context) - DUJMOVI, WOOD et al. - 2002
6:   Laying out graphs using queues (context) - Heath, Rosenberg - 1992
6:   Three-dimensional graph drawing (context) - Cohen, Eades et al.
6:   Straight-line drawings on restricted integer grids in two and three dimensions - FELSNER, WISMATH et al. - 2002
5:   A Decomposition Theorem for Partially Ordered Sets (context) - Dilworth - 1950
5:   Exploring the Powers of Stacks and Queues via Graph Layouts (context) - Pemmaraju - 1992
5:   arboretum of graphs with bounded treewidth (context) - Bodlaender, k- - 1996
5:   On acyclic colorings of graphs on surfaces (context) - Alon, Mohar et al. - 1996
5:   Acyclic colorings of planar graphs (context) - Gr - 1973
5:   Acyclic colourings of planar graphs with large girth (context) - BORODIN, KOSTOCHKA et al. - 1999
5:   Stack and queue number of 2- trees (context) - RENGARAJAN, MADHAVAN - 1995

CiteSeer.IST - Copyright Penn State and NEC