The following pages link to Kenny Štorgel (Q2107747):
Displaying 10 items.
- Improved bounds for some facially constrained colorings (Q2107748) (← links)
- Treewidth versus clique number in graph classes with a forbidden structure (Q2110610) (← links)
- Further extensions of the Grötzsch theorem (Q2124638) (← links)
- 3-facial edge-coloring of plane graphs (Q2689486) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- 2-distance, injective, and exact square list-coloring of planar graphs with maximum degree 4 (Q6041534) (← links)
- Locally irregular edge-coloring of subcubic graphs (Q6064843) (← links)
- Functionality of box intersection graphs (Q6140059) (← links)
- Treewidth versus clique number. II: Tree-independence number (Q6144406) (← links)
- Treewidth versus clique number. III. Tree-independence number of graphs with a forbidden structure (Q6403600) (← links)
