The following pages link to Zdeněk Dvořák (Q213911):
Displayed 50 items.
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- 5-list-coloring planar graphs with distant precolored vertices (Q345086) (← links)
- A minimum degree condition forcing complete graph immersion (Q397072) (← links)
- Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260) (← links)
- Forbidden graphs for tree-depth (Q412288) (← links)
- Bipartizing fullerenes (Q427819) (← links)
- Chromatic number and complete graph substructures for degree sequences (Q485549) (← links)
- 5-choosability of graphs with crossings far apart (Q505910) (← links)
- Spectral radius of finite and infinite planar graphs and of graphs of bounded genus (Q602728) (← links)
- Randić index and the diameter of a graph (Q627931) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- Spectrally degenerate graphs: hereditary case (Q713975) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- Four gravity results (Q864159) (← links)
- Noncrossing Hamiltonian paths in geometric graphs (Q885281) (← links)
- Fractional coloring of triangle-free planar graphs (Q888619) (← links)
- Immersion in four-edge-connected graphs (Q895999) (← links)
- Packing six \(T\)-joins in plane graphs (Q896004) (← links)
- Sublinear separators, fragility and subexponential expansion (Q896068) (← links)
- On forbidden subdivision characterizations of graph classes (Q925035) (← links)
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979) (← links)
- Small graph classes and bounded expansion (Q965245) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Crossing-critical graphs with large maximum degree (Q974468) (← links)
- Two-factors in orientated graphs with forbidden transitions (Q998498) (← links)
- A note on antisymmetric flows in graphs (Q1041206) (← links)
- Planar graphs without 3-, 7-, and 8-cycles are 3-choosable (Q1045077) (← links)
- Triangle-free planar graphs with small independence number (Q1633607) (← links)
- Induced subdivisions and bounded expansion (Q1686256) (← links)
- Density of 5/2-critical graphs (Q1705839) (← links)
- On generalized choice and coloring numbers (Q1733934) (← links)
- Planar graphs have two-coloring number at most 8 (Q1745736) (← links)
- On classes of graphs with strongly sublinear separators (Q1750205) (← links)
- Induced 2-degenerate subgraphs of triangle-free planar graphs (Q1753031) (← links)
- Constant-factor approximation of the domination number in sparse graphs (Q1943391) (← links)
- A Thomassen-type method for planar graph recoloring (Q2033925) (← links)
- Three-coloring triangle-free graphs on surfaces. V: Coloring planar graphs with distant anomalies (Q2040020) (← links)
- Three-coloring triangle-free graphs on surfaces. IV: Bounding face sizes of 4-critical graphs (Q2040021) (← links)
- Notes on graph product structure theory (Q2058955) (← links)
- Additive non-approximability of chromatic number in proper minor-closed classes (Q2099409) (← links)
- Three-coloring triangle-free graphs on surfaces. III. Graphs of girth five (Q2200929) (← links)
- On fractional fragility rates of graph classes (Q2205120) (← links)
- An update on reconfiguring 10-colorings of planar graphs (Q2223443) (← links)
- Bounding the number of cycles in a graph in terms of its degree sequence (Q2225410) (← links)
- Coloring near-quadrangulations of the cylinder and the torus (Q2225450) (← links)
- A note on sublinear separators and expansion (Q2225455) (← links)
- Treewidth of graphs with balanced separations (Q2312607) (← links)