Strong chromatic index of planar graphs with large girth

DOI10.7151/DMGT.1763MaRDI QIDQ472129zbMATH OpenOpenAlexFDO

Authors Gerard Jennhwa Chang, Arnaud Pêcher, Mickaël Montassier, André Raspaud

Publication date 18 November 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1763

zbMATH Keywords

planar graphsedge coloringstrong edge coloring2-distance-coloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Strong chromatic index of planar graphs with large girth
• Strong edge-coloring for planar graphs with large girth
• On the precise value of the strong chromatic index of a planar graph with a large girth
• Strong edge-coloring of planar graphs
• Strong edge-colorings of planar graphs with small girth

Cites work

• scientific article; zbMATH DE number 3882451 (Why is no real title available?)
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• scientific article; zbMATH DE number 3752880 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• A bound on the strong chromatic index of a graph
• Colorings and girth of oriented planar graphs
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Induced matchings in cubic graphs
• Planar graphs of maximum degree seven are Class I
• Precise upper bound for the strong edge chromatic number of sparse planar graphs
• Problems and results in combinatorial analysis and graph theory
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Strong edge-colouring and induced matchings
• The strong chromatic index of a cubic graph is at most 10
• The strong chromatic index ofC4-free graphs

Cited in

(15)

• Strong edge-colorings of sparse graphs with large maximum degree
• Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs
• On the precise value of the strong chromatic index of a planar graph with a large girth
• Facial \(L(2, 1)\)-edge-labelings of trees
• Acyclic chromatic indices of planar graphs with large girth
• Odd graph and its applications to the strong edge coloring
• Semistrong edge colorings of planar graphs
• From light edges to strong edge-colouring of 1-planar graphs
• Upper bounds for the strong chromatic index of Halin graphs
• Strong edge-coloring for jellyfish graphs
• Recent progress on strong edge-coloring of graphs
• Strong edge-coloring for planar graphs with large girth
• On the strong chromatic index of sparse graphs
• Tree-like distance colouring for planar graphs of sufficient girth
• On 4-edge colouring planar bridgeless graphs with large girth

This page was built for publication: Strong chromatic index of planar graphs with large girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472129)