Pages that link to "Item:Q834929"
From MaRDI portal
The following pages link to Acyclic colorings of subcubic graphs (Q834929):
Displaying 50 items.
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Some results on acyclic edge coloring of plane graphs (Q407591) (← links)
- Acyclic edge coloring of planar graphs without 5-cycles (Q423934) (← 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)
- Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle (Q489715) (← links)
- The complexity of some acyclic improper colourings (Q533784) (← links)
- Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
- Analysis of a heuristic for acyclic edge colouring (Q845729) (← 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)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← 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)
- Acyclic edge coloring of planar graphs without small cycles (Q1926054) (← links)
- Acyclic colorings of graph subdivisions revisited (Q1932357) (← 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)
- Graphs with maximum degree \(6\) are acyclically \(11\)-colorable (Q1944128) (← links)
- Acyclic chromatic index of planar graphs with triangles (Q1944145) (← links)
- Acyclic edge coloring of planar graphs without 4-cycles (Q1956244) (← links)
- Acyclic improper colouring of graphs with maximum degree 4 (Q2018890) (← 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 planar graphs without cycles of specific lengths (Q2251751) (← links)
- Acyclic chromatic indices of planar graphs with large girth (Q2275931) (← links)
- The \(r\)-acyclic chromatic number of planar graphs (Q2343993) (← links)
- Acyclic coloring of graphs of maximum degree five: nine colors are enough (Q2380043) (← 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 vertex coloring of graphs of maximum degree six (Q2449135) (← links)
- Acyclic Vertex Coloring of Graphs of Maximum Degree Six (Q2840537) (← 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)
- Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs (Q3104769) (← links)
- Acyclic edge coloring of 2-degenerate graphs (Q3113277) (← links)
- Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4 (Q5325950) (← links)