The following pages link to (Q4542572):
Displaying 50 items.
- Improved bounds on the generalized acyclic chromatic number (Q272792) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← 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)
- 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)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← 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)
- Short length Menger's theorem and reliable optical routing (Q557907) (← 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)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
- Further result on acyclic chromatic index of planar graphs (Q908318) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Acyclic edge colouring of planar graphs without short cycles (Q968412) (← links)
- About acyclic edge colourings of planar graphs (Q975506) (← links)
- Acyclic edge coloring of subcubic graphs (Q998411) (← links)
- Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
- A note on acyclic edge coloring of complete bipartite graphs (Q1044002) (← links)
- Acyclic edge coloring of 4-regular graphs without 3-cycles (Q1712783) (← links)
- Generalized acyclic edge colorings via entropy compression (Q1743494) (← links)
- Asymptotically the list colouring constants are 1 (Q1850621) (← links)
- Acyclic edge coloring of planar graphs without small cycles (Q1926054) (← links)
- Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
- Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices (Q1944091) (← 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)
- A new bound on the acyclic edge chromatic number (Q2198378) (← 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 chromatic indices of planar graphs with large girth (Q2275931) (← links)
- The local cut lemma (Q2357223) (← links)
- Rainbow Hamilton cycles and lopsidependency (Q2400558) (← links)
- Acyclic chromatic index of triangle-free 1-planar graphs (Q2409523) (← links)
