Approximation algorithms for constructing required subgraphs using stock pieces of fixed length | 0 | 0.34 | 2022 |
Ic-Planar Graphs Are 6-Choosable | 0 | 0.34 | 2021 |
Plane Graphs Of Maximum Degree Delta >= 7 Are Edge-Face (Delta+1)-Colorable | 0 | 0.34 | 2020 |
A note on m-near-factor-critical graphs | 0 | 0.34 | 2019 |
Upper bounds for the strong chromatic index of Halin graphs. | 0 | 0.34 | 2018 |
Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces. | 0 | 0.34 | 2018 |
Approximation algorithms for constructing spanning K-trees using stock pieces of bounded length. | 0 | 0.34 | 2017 |
Legally $$\\varDelta +2$$Δ+2-Coloring Bipartite Outerplanar Graphs in Cubic Time | 0 | 0.34 | 2015 |
Chordal Graphs are Fully Orientable | 0 | 0.34 | 2015 |
Full Orientability of the Square of a Cycle. | 0 | 0.34 | 2015 |
An improved upper bound on the adjacent vertex distinguishing chromatic index of a graph | 4 | 0.57 | 2014 |
Nordhaus-Gaddum-type relations of three graph coloring parameters | 1 | 0.37 | 2014 |
When is the Direct Product of Generalized Mycielskians a Cover Graph? | 0 | 0.34 | 2014 |
Approximation algorithms for solving the constrained arc routing problem in mixed graphs. | 2 | 0.35 | 2014 |
Preface: optimization in graphs. | 0 | 0.34 | 2013 |
Equivalence of two conjectures on equitable coloring of graphs. | 1 | 0.36 | 2013 |
Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set. | 0 | 0.34 | 2013 |
Acyclic List Edge Coloring of Graphs. | 0 | 0.34 | 2013 |
On the strong chromatic index of cubic Halin graphs. | 6 | 0.52 | 2012 |
The strong chromatic index of Halin graphs | 5 | 0.49 | 2012 |
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. | 10 | 0.75 | 2011 |
On preserving full orientability of graphs | 2 | 0.44 | 2010 |
Multi-color Ramsey numbers of even cycles | 9 | 0.78 | 2009 |
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles | 6 | 0.57 | 2009 |
Coloring the square of the Kneser graph I and the Schrijver graph I | 3 | 0.42 | 2009 |
On (d,1)-total numbers of graphs | 11 | 0.66 | 2009 |
Full orientability of graphs with at most one dependent arc | 1 | 0.37 | 2009 |
Non-cover generalized Mycielski, Kneser, and Schrijver graphs | 0 | 0.34 | 2008 |
Note On Coloring The Square Of An Outerplanar Graph | 0 | 0.34 | 2008 |
Coupled choosability of plane graphs | 7 | 0.66 | 2008 |
On fully orientability of 2-degenerate graphs | 5 | 0.55 | 2008 |
On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability | 0 | 0.34 | 2007 |
On an interpolation property of outerplanar graphs | 7 | 0.69 | 2006 |
List Coloring Halin Graphs | 3 | 0.40 | 2005 |
The Linear 2-Arboricity Of Outerplanar Graphs | 1 | 0.38 | 2004 |
The edge-face choosability of plane graphs | 7 | 0.57 | 2004 |
Coloring the square of a K4-minor free graph | 30 | 2.25 | 2003 |
Labeling Planar Graphs with Conditions on Girth and Distance Two | 46 | 3.43 | 2003 |
The Linear 2-Arboricity of Planar Graphs | 12 | 0.87 | 2003 |
Choosability and edge choosability of planar graphs without five cycles | 36 | 1.96 | 2002 |
Edge-partitions of planar graphs and their game coloring numbers | 43 | 4.24 | 2002 |
Circular chromatic numbers of some reduced Kneser graphs | 10 | 1.35 | 2002 |
Edge-pancyclicity of coupled graphs | 8 | 0.78 | 2002 |
Choosability and Edge Choosability of Planar Graphs without Intersecting Triangles | 24 | 1.29 | 2002 |
A new proof of Melnikov's conjecture on the edge-face coloring of plane graphs. | 8 | 0.63 | 2002 |
A note on list improper coloring planar graphs | 24 | 1.72 | 2001 |
Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles | 10 | 0.75 | 2001 |
An improvement on a Spernerity proof of Horrocks | 0 | 0.34 | 2001 |
Choosability, edge choosability, and total choosability of outerplane graphs | 16 | 1.07 | 2001 |
On Cycle Sequences | 0 | 0.34 | 2001 |