Acyclic edge coloring of 4-regular graphs. II.

DOI10.1007/S40840-017-0592-7MaRDI QIDQ2272610zbMATH OpenOpenAlexFDO

Authors Yulai Ma, Qiaojun Shu, Weifan Wang, Yiqiao Wang

Publication date 20 September 2019

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-017-0592-7

zbMATH Keywords

4-regular graphacyclic edge coloringmaximum degree

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Recommendations

• Acyclic edge coloring of 4-regular graphs without 3-cycles
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic edge coloring of planar graphs without 4-cycles
• Acyclic edge coloring of chordal graphs with bounded degree
• Acyclic edge coloring of sparse graphs

Cites work

• A new upper bound on the acyclic chromatic indices of planar graphs
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4
• Acyclic coloring of graphs
• Acyclic edge chromatic number of outerplanar graphs
• Acyclic edge coloring of 2-degenerate graphs
• Acyclic edge coloring of 4-regular graphs without 3-cycles
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic edge coloring of subcubic graphs
• Acyclic edge colorings of graphs
• Acyclic edge-coloring of planar graphs
• Acyclic edge-coloring using entropy compression
• scientific article; zbMATH DE number 3603300 (Why is no real title available?)
• scientific article; zbMATH DE number 1775440 (Why is no real title available?)
• Improved bounds on coloring of graphs
• On the algorithmic Lovász local lemma and acyclic edge coloring
• Optimal acyclic edge-coloring of cubic graphs

Cited in

(9)

• Acyclic edge coloring of 4-regular graphs without 3-cycles
• Acyclic edge coloring of chordal graphs with bounded degree
• Acyclic edge colorings of graphs
• Acyclic edge coloring of graphs with maximum degree 4
• Acyclic list edge coloring of graphs with maximum degree 4
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
• Planar graphs are acyclically edge \((\Delta + 5)\)-colorable
• Acyclically edge color triangle-free toroidal graphs in + 2 colors

This page was built for publication: Acyclic edge coloring of 4-regular graphs. II.

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