The following pages link to Jakub Pekárek (Q1642704):
Displaying 15 items.
- On generalized choice and coloring numbers (Q1733934) (← links)
- The minimum number of spanning trees in regular multigraphs (Q2112560) (← links)
- Coloring near-quadrangulations of the cylinder and the torus (Q2225450) (← links)
- A note on connected greedy edge colouring (Q2231754) (← links)
- On the simultaneous minimum spanning trees problem (Q2636567) (← links)
- Characterization of 4-critical triangle-free toroidal graphs (Q2668022) (← links)
- (Q5089220) (← links)
- Minimal sum labeling of graphs (Q5915648) (← links)
- Irreducible 4-critical triangle-free toroidal graphs (Q5915812) (← links)
- Minimal sum labeling of graphs (Q5915910) (← links)
- Induced odd cycle packing number, independent sets, and chromatic number (Q6074594) (← links)
- (Q6168483) (← links)
- (Q6192490) (← links)
- A Complexity Dichotomy for Permutation Pattern Matching on Grid Classes (Q6346853) (← links)
- Weak Coloring Numbers of Intersection Graphs (Q6364240) (← links)
