Pages that link to "Item:Q5126756"
From MaRDI portal
The following pages link to Planar graphs have bounded nonrepetitive chromatic number (Q5126756):
Displaying 16 items.
- An improved planar graph product structure theorem (Q2152790) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
- A note about online nonrepetitive coloring \(k\)-trees (Q2197409) (← links)
- A fast algorithm for the product structure of planar graphs (Q2663717) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- Two Results on Layered Pathwidth and Linear Layouts (Q5144880) (← links)
- Shorter Labeling Schemes for Planar Graphs (Q5866447) (← links)
- Clustered 3-colouring graphs of bounded degree (Q5886311) (← links)
- Separating layered treewidth and row treewidth (Q6045398) (← links)
- Improved product structure for graphs on surfaces (Q6045446) (← links)
- Shallow Minors, Graph Products, and Beyond-Planar Graphs (Q6130539) (← links)
- The product structure of squaregraphs (Q6143380) (← links)
- Graph product structure for non-minor-closed classes (Q6170788) (← links)
- Extensions and reductions of squarefree words (Q6177427) (← links)