Pages that link to "Item:Q5921616"
From MaRDI portal
The following pages link to Acyclic colorings of planar graphs (Q5921616):
Displaying 50 items.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Equitable vertex arboricity of subcubic graphs (Q267194) (← links)
- Improved bounds on the generalized acyclic chromatic number (Q272792) (← links)
- On purely tree-colorable planar graphs (Q280945) (← links)
- Acyclic coloring of graphs with some girth restriction (Q281769) (← links)
- A polyhedral investigation of star colorings (Q284838) (← links)
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles (Q294558) (← links)
- New bounds for the acyclic chromatic index (Q294561) (← links)
- I,F-partitions of sparse graphs (Q298327) (← links)
- Acyclic colorings of graphs with bounded degree (Q310229) (← links)
- Star chromatic bounds (Q327688) (← links)
- Strongly polynomial sequences as interpretations (Q334158) (← links)
- Star coloring of graphs with girth at least five (Q343773) (← links)
- Parmenides reloaded (Q351453) (← links)
- From change to spacetime: an eleatic journey (Q360435) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- On linear coloring of planar graphs with small girth (Q400495) (← links)
- Star coloring of cubic graphs (Q402363) (← links)
- Improved upper bounds on acyclic edge colorings (Q403494) (← links)
- Vertex-arboricity of planar graphs without intersecting triangles (Q412284) (← links)
- Acyclic edge coloring of planar graphs with \(\varDelta\) colors (Q423967) (← links)
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- Weights of induced subgraphs in \(K_{1,r}\)-free graphs (Q442341) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- On acyclic edge-coloring of the complete bipartite graphs \(K_{2p-1, 2p-1}\) for odd prime \(p\) (Q501029) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- The complexity of some acyclic improper colourings (Q533784) (← links)
- Acyclic 4-choosability of planar graphs (Q616366) (← links)
- Improved bounds on linear coloring of plane graphs (Q625757) (← links)
- Acyclic vertex coloring of graphs of maximum degree 5 (Q626789) (← links)
- \(k\)-forested coloring of planar graphs with large girth (Q632996) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Linear and 2-frugal choosability of graphs of small maximum average degree (Q659749) (← links)
- Degenerate and star colorings of graphs on surfaces (Q661942) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- On the complexity of generalized chromatic polynomials (Q679542) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- Optimal acyclic edge colouring of grid like graphs (Q710564) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- List total arboricity of 2-degenerate graphs (Q714512) (← links)
- On acyclic edge-coloring of complete bipartite graphs (Q729782) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- Black, white and gray: Quine on convention (Q813429) (← links)
