The following pages link to Zdeněk Dvořák (Q213911):
Displaying 50 items.
- Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable (Q2323251) (← links)
- Pattern hypergraphs (Q2380447) (← links)
- On a Rado type problem for homogeneous second order linear recurrences (Q2380472) (← links)
- Do triangle-free planar graphs have exponentially many 3-colorings? (Q2401433) (← links)
- Triangle-free graphs of tree-width \(t\) are \(\lceil (t+3)/2 \rceil\)-colorable (Q2403691) (← links)
- Coloring squares of planar graphs with girth six (Q2427536) (← links)
- 3-choosability of planar graphs with \((\leqslant 4)\)-cycles far apart (Q2434715) (← links)
- Distance-two coloring of sparse graphs (Q2441647) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
- 1-subdivisions, the fractional chromatic number and the Hall ratio (Q2663411) (← links)
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm (Q2664564) (← links)
- Characterization of 4-critical triangle-free toroidal graphs (Q2668022) (← links)
- Triangle-free planar graphs with at most \(64^{n^{0.731}}\) 3-colorings (Q2673487) (← links)
- Bounded degree conjecture holds precisely for \(c\)-crossing-critical graphs with \(c \le 12\) (Q2678451) (← links)
- Strongly sublinear separators and polynomial expansion (Q2808163) (← links)
- Crossing numbers of periodic graphs (Q2825478) (← links)
- A structure theorem for strong immersions (Q2825487) (← links)
- A Dynamic Data Structure for Counting Subgraphs in Sparse Graphs (Q2842169) (← links)
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (extended abstract) (Q2851447) (← links)
- A Dynamic Data Structure for MSO Properties in Graphs with Bounded Tree-Depth (Q2921418) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q2921419) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles (Q3008018) (← links)
- On recognizing graphs by numbers of homomorphisms (Q3057061) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs I. Planar Graphs with Two Triangles and 3-Colorability of Chains (Q3177443) (← links)
- Three-coloring triangle-free planar graphs in linear time (Q3189025) (← links)
- Graphs with Two Crossings Are 5-Choosable (Q3225151) (← links)
- Probabilistic strategies for the partition and plurality problems (Q3419612) (← links)
- On Planar Boolean CSP (Q3448805) (← links)
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs (Q3553229) (← links)
- List-Coloring Squares of Sparse Subcubic Graphs (Q3614198) (← links)
- Planar Graphs of Odd-Girth at Least 9 are Homomorphic to the Petersen Graph (Q3629463) (← links)
- (Q4414494) (← links)
- Complete graph immersions and minimum degree (Q4575527) (← links)
- Fine Structure of 4-Critical Triangle-Free Graphs III. General Surfaces (Q4601215) (← links)
- Thin graph classes and polynomial-time approximation schemes (Q4607999) (← links)
- Triangle‐free planar graphs with the smallest independence number (Q4630003) (← links)
- (Q4633818) (← links)
- (Q4633932) (← links)
- Graphic TSP in cubic graphs (Q4636625) (← links)
- Independent sets near the lower bound in bounded degree graphs (Q4636626) (← links)
- Star Chromatic Index (Q4916092) (← links)
- Strong Immersions and Maximum Degree (Q4979833) (← links)
- 4-Critical Graphs on Surfaces Without Contractible $(\le\!4)$-Cycles (Q4979854) (← links)
- Sublinear Separators in Intersection Graphs of Convex Shapes (Q4992837) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q5002722) (← links)
- Flexibility of planar graphs of girth at least six (Q5066932) (← links)
- (Q5088941) (← links)
- Structure and generation of crossing-critical graphs (Q5115801) (← links)
