The following pages link to (Q4542572):
Displayed 50 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)
- On \(r\)-acyclic edge colorings of planar graphs (Q442224) (← 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)
- Analysis of a heuristic for acyclic edge colouring (Q845729) (← links)
- Generalised acyclic edge colourings of graphs with large girth (Q879345) (← 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)
- 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 chromatic indices of planar graphs with large girth (Q2275931) (← 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)
- Improved bounds on acyclic edge colouring (Q2462375) (← links)
- Bounds on the generalised acyclic chromatic numbers of bounded degree graphs (Q2494116) (← links)
- Acyclic edge colorings of graphs (Q2746208) (← links)
- Acyclic edge-colouring of planar graphs. Extended abstract (Q2851497) (← 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)
- Colouring Non-sparse Random Intersection Graphs (Q3182958) (← links)
- The generalized acyclic edge chromatic number of random regular graphs (Q3419704) (← links)
- The fractional congestion bound for efficient edge disjoint routing (Q3507649) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)
- (Q4248539) (← links)
- (Q4521547) (← links)
- (Q4521554) (← links)
- Optimal acyclic edge‐coloring of cubic graphs (Q4650186) (← links)
- A (1 + ?)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lov�sz Local Lemma (Q4810508) (← links)