Pages that link to "Item:Q4680406"

The following pages link to The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (Q4680406):

Displaying 23 items.

• Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← links)
• Acyclic chromatic indices of planar graphs with girth at least five (Q434197) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• The cook-book approach to the differential equation method (Q465658) (← links)
• On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) (Q501029) (← links)
• Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
• On acyclic edge-coloring of complete bipartite graphs (Q729782) (← links)
• Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
• Analysis of a heuristic for acyclic edge colouring (Q845729) (← links)
• Acyclic edge coloring of subcubic graphs (Q998411) (← links)
• A note on acyclic edge coloring of complete bipartite graphs (Q1044002) (← links)
• Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
• Acyclic edge coloring of planar graphs without 4-cycles (Q1956244) (← links)
• Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
• Local conditions for planar graphs of acyclic edge coloring (Q2142486) (← links)
• Acyclic chromatic indices of planar graphs with large girth (Q2275931) (← links)
• Acyclic edge coloring of planar graphs without adjacent cycles (Q2445495) (← links)
• Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116) (← links)
• An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663) (← links)
• Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
• Acyclic List Edge Coloring of Graphs (Q4916089) (← links)
• (Q5037979) (← links)
• Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 (Q5325950) (← links)