Pages that link to "Item:Q998411"
From MaRDI portal
The following pages link to Acyclic edge coloring of subcubic graphs (Q998411):
Displaying 29 items.
- Some results on acyclic edge coloring of plane graphs (Q407591) (← links)
- Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← 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)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← 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 4-regular graphs without 3-cycles (Q1712783) (← links)
- Acyclic edge coloring of planar graphs without small cycles (Q1926054) (← links)
- Acyclic edge coloring of graphs with large girths (Q1934376) (← 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)
- Acyclic edge coloring of 4-regular graphs. II. (Q2272610) (← 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)
- Linear colorings of subcubic graphs (Q2444734) (← links)
- Acyclic edge coloring of planar graphs without adjacent cycles (Q2445495) (← links)
- Acyclic 4-edge colouring of non-regular subcubic graphs in linear time (Q2449094) (← links)
- An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Acyclic edge coloring of graphs with maximum degree 4 (Q3652530) (← links)
- Optimal acyclic edge‐coloring of cubic graphs (Q4650186) (← links)
- Acyclic edge coloring of 1-planar graphs without 4-cycles (Q6137646) (← links)
