Amanote Research

Amanote Research

    RegisterSign In

Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ Is Large

SIAM Journal on Discrete Mathematics - United States
doi 10.1137/17m1158355
Full Text
Open PDF
Abstract

Available in full text

Categories
Mathematics
Date

January 1, 2019

Authors
Daniel W. Cranston
Publisher

Society for Industrial & Applied Mathematics (SIAM)


Related search

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

Fast Heuristics for the Edge Coloring of Large Graphs

2003English

Acyclic Vertex Coloring of Graphs of Maximum Degree 5

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Total Coloring of Claw-Free Planar Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2020English

Edge Coloring of Graphs, Uses, Limitation, Complexity

Acta Universitatis Sapientiae, Informatica
2016English

Directed Acyclic Graphs With Edge-Specific Bounds

Biometrika
StatisticsProbabilityUncertaintyApplied MathematicsBiological SciencesAgriculturalMathematics
2011English

Optimal Strong Parity Edge-Coloring of Complete Graphs

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
2008English

Matroids, Delta-Matroids and Embedded Graphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

Edge Weight Reduction Problems in Directed Acyclic Graphs

Journal of Algorithms
1997English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy