Pages that link to "Item:Q3652530"

The following pages link to Acyclic edge coloring of graphs with maximum degree 4 (Q3652530):

Displaying 36 items.

• Some results on acyclic edge coloring of plane graphs (Q407591) (← links)
• Improved bounds on coloring of graphs (Q412254) (← links)
• Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← links)
• Acyclic edge coloring of planar graphs with \(\varDelta\) colors (Q423967) (← links)
• Acyclic edge colouring of plane graphs (Q427892) (← links)
• Acyclic chromatic indices of planar graphs with girth at least five (Q434197) (← links)
• Acyclic chromatic indices of fully subdivided graphs (Q436602) (← links)
• Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
• Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
• Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
• About acyclic edge colourings of planar graphs (Q975506) (← links)
• Acyclic edge coloring of 4-regular graphs without 3-cycles (Q1712783) (← links)
• Acyclic edge coloring of sparse graphs (Q1759399) (← links)
• Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
• On acyclic edge coloring of toroidal graphs (Q1944102) (← links)
• Acyclic chromatic index of planar graphs with triangles (Q1944145) (← links)
• An improved bound on acyclic chromatic index of planar graphs (Q1945955) (← links)
• Acyclic edge coloring of planar graphs without 4-cycles (Q1956244) (← links)
• Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
• Acyclic edge coloring of chordal graphs with bounded degree (Q2053722) (← links)
• Local conditions for planar graphs of acyclic edge coloring (Q2142486) (← links)
• Acyclic edge coloring of planar graphs without cycles of specific lengths (Q2251751) (← links)
• Acyclic edge coloring of 4-regular graphs. II. (Q2272610) (← links)
• Acyclic edge coloring of graphs (Q2440127) (← links)
• The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle (Q2444561) (← links)
• Acyclic edge coloring of planar graphs without adjacent cycles (Q2445495) (← links)
• Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
• Acyclic Edge-Coloring of Planar Graphs: $\Delta$ Colors Suffice When $\Delta$ is Large (Q4631096) (← links)
• Optimal acyclic edge‐coloring of cubic graphs (Q4650186) (← links)
• Acyclic Edge Coloring of Triangle‐Free Planar Graphs (Q4650187) (← links)
• Acyclic List Edge Coloring of Graphs (Q4916089) (← links)
• (Q5037979) (← links)
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 (Q5325950) (← links)
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918364) (← links)
• Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles (Q5918607) (← links)
• Planar graphs are acyclically edge \((\Delta + 5)\)-colorable (Q6571271) (← links)