Pages that link to "Item:Q1257487"
From MaRDI portal
The following pages link to On acyclic colorings of planar graphs (Q1257487):
Displaying 50 items.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- Equitable vertex arboricity of subcubic graphs (Q267194) (← links)
- Hamiltonicity and generalised total colourings of planar graphs (Q274671) (← links)
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- An oriented 6-coloring of planar graphs with girth at least 9 (Q293643) (← links)
- I,F-partitions of sparse graphs (Q298327) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- Maximum induced forests in graphs of bounded treewidth (Q396918) (← links)
- Adapted game colouring of graphs (Q412230) (← links)
- From the plane to higher surfaces (Q444375) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- Acyclic 6-choosability of planar graphs without adjacent short cycles (Q476645) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- Nonrepetitive colorings of line arrangements (Q499479) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← 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)
- Degenerate and star colorings of graphs on surfaces (Q661942) (← links)
- Acyclically 3-colorable planar graphs (Q695319) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- What is on his mind? (Q709300) (← 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)
- Each 3-polytope with minimum degree 5 has a 7-cycle with maximum degree at most 15 (Q748469) (← links)
- Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs (Q753827) (← links)
- \(k\)-forested choosability of planar graphs and sparse graphs (Q764887) (← links)
- Oriented colorings of triangle-free planar graphs (Q834898) (← links)
- Acyclic colorings of subcubic graphs (Q834929) (← links)
- Acyclic colorings of products of trees (Q845661) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- On low tree-depth decompositions (Q897253) (← links)
- The chromatic number of a signed graph (Q907266) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Nonrepetitive colorings of graphs -- a survey (Q925326) (← links)
- On acyclic 4-choosability of planar graphs without short cycles (Q982617) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- Acyclic edge coloring of subcubic graphs (Q998411) (← links)
- Acyclic and \(k\)-distance coloring of the grid (Q1014392) (← links)
- On the acyclic chromatic number of Hamming graphs (Q1014824) (← links)
- Decomposing a planar graph of girth 5 into an independent set and a forest (Q1026008) (← links)
- Acyclic edge coloring of planar graphs with large girth (Q1034642) (← links)
- Acyclic edge colorings of planar graphs and series parallel graphs (Q1042911) (← links)
