The following pages link to (Q4168628):
Displayed 32 items.
- Improved bounds on the generalized acyclic chromatic number (Q272792) (← links)
- New bounds for the acyclic chromatic index (Q294561) (← links)
- Improved upper bounds on acyclic edge colorings (Q403494) (← links)
- Some results on acyclic edge coloring of plane graphs (Q407591) (← links)
- On acyclic edge coloring of planar graphs without intersecting triangles (Q409363) (← 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 fully subdivided graphs (Q436602) (← links)
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) (Q501029) (← links)
- Acyclic edge coloring through the Lovász local lemma (Q507595) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- On acyclic edge-coloring of complete bipartite graphs (Q729782) (← links)
- Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
- Further result on acyclic chromatic index of planar graphs (Q908318) (← 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)
- On acyclic edge coloring of toroidal graphs (Q1944102) (← links)
- Acyclic edge coloring of planar graphs without 4-cycles (Q1956244) (← links)
- Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles (Q2015791) (← links)
- The local cut lemma (Q2357223) (← links)
- Acyclic chromatic index of triangle-free 1-planar graphs (Q2409523) (← 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 2-degenerate graphs (Q3113277) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)
- Acyclic Edge Coloring of Triangle‐Free Planar Graphs (Q4650187) (← links)
- <i>d</i>‐Regular graphs of acyclic chromatic index at least <i>d</i>+2 (Q5190332) (← links)