The system will be going down for regular maintenance. Please save your work and logout.
Strong chromatic index of planar graphs with large girth
CHANG, Gerard Jennhwa
Taida Institute for Mathematical Sciences [National Taiwan University] [TIMS | NTU]
Taida Institute for Mathematical Sciences [National Taiwan University] [TIMS | NTU]
PÊCHER, Arnaud
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
See more >
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
CHANG, Gerard Jennhwa
Taida Institute for Mathematical Sciences [National Taiwan University] [TIMS | NTU]
Taida Institute for Mathematical Sciences [National Taiwan University] [TIMS | NTU]
PÊCHER, Arnaud
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
< Reduce
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Language
en
Article de revue
This item was published in
Discussiones Mathematicae Graph Theory. 2014, vol. 34, n° 4, p. 723-733
University of Zielona Góra
English Abstract
Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G ...Read more >
Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree Δ. This improves [6] when Δ ≥ 6.Read less <
English Keywords
Planar graphs
Edge coloring
2-distance coloring
Strong edgecoloring
Origin
Hal imported