The following pages link to Acyclic edge colorings of graphs (Q2746208):
Displaying 44 items.
- Acyclic edge coloring of 4-regular graphs. II. (Q2272610) (← links)
- Acyclic chromatic indices of planar graphs with large girth (Q2275931) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- The local cut lemma (Q2357223) (← links)
- Acyclic chromatic index of triangle-free 1-planar graphs (Q2409523) (← links)
- The method of coloring in graphs and its application (Q2429917) (← 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 using entropy compression (Q2444732) (← 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)
- Improved bounds on acyclic edge colouring (Q2462375) (← links)
- Acyclic colouring of some line graphs (Q2844386) (← links)
- Acyclic edge-colouring of planar graphs (extended abstract) (Q2851497) (← links)
- Acyclic edge coloring of triangle-free toroidal graphs (Q2924785) (← links)
- A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
- An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663) (← links)
- Acyclic edge chromatic number of outerplanar graphs (Q3055902) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Polychromatic Acyclic Tours in Colored Multigraphs (Q3328573) (← links)
- The generalized acyclic edge chromatic number of random regular graphs (Q3419704) (← links)
- (Q3452053) (← links)
- Optimal Acyclic Edge Colouring of Grid Like Graphs (Q3591309) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)
- Graph colorings and acyclic orientations (Q3768909) (← 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)
- The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (Q4680406) (← links)
- Acyclic List Edge Coloring of Graphs (Q4916089) (← links)
- Star Chromatic Index (Q4916092) (← links)
- Acyclic edge colourings of graphs with large girth (Q4978429) (← links)
- (Q5037979) (← links)
- <i>d</i>‐Regular graphs of acyclic chromatic index at least <i>d</i>+2 (Q5190332) (← links)
- (Q5320468) (← 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)
- Acyclic chromatic index of chordless graphs (Q6041561) (← links)
- Acyclic edge coloring of 1-planar graphs without 4-cycles (Q6137646) (← links)
- Edge colorings avoiding patterns (Q6181991) (← links)
- Upper bounds on the acyclic chromatic index of degenerate graphs (Q6197756) (← links)
- Planar graphs are acyclically edge \((\Delta + 5)\)-colorable (Q6571271) (← links)
- Edge colorings avoiding patterns (Q6621191) (← links)
