The following pages link to Daniel Král' (Q273100):
Displaying 50 items.
- (Q213912) (redirect page) (← links)
- A problem of Erdős and Sós on 3-graphs (Q273102) (← links)
- Three-coloring triangle-free graphs on surfaces. I: Extending a coloring to a disk with one triangle. (Q290801) (← links)
- Third case of the cyclic coloring conjecture (Q322178) (← links)
- Weak regularity and finitely forcible graph limits (Q322209) (← links)
- First order convergence of matroids (Q326662) (← links)
- Densities in large permutations and parameter testing (Q338581) (← links)
- Steinberg's conjecture is false (Q345097) (← links)
- Classes of graphs with small rank decompositions are \(\chi \)-bounded (Q412260) (← links)
- A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
- Decomposition width of matroids (Q415290) (← links)
- A new lower bound based on Gromov's method of selecting heavily covered points (Q452003) (← links)
- Finitely forcible graphons and permutons (Q473103) (← links)
- Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
- Embedding longest fault-free paths onto star graphs with more vertex faults (Q557839) (← links)
- Graphs with bounded tree-width and large odd-girth are almost bipartite (Q602711) (← links)
- Equipartite polytopes (Q607856) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- Cyclic colorings of plane graphs with independent faces (Q661937) (← links)
- On the removal lemma for linear systems over abelian groups (Q691583) (← links)
- Coloring face hypergraphs on surfaces (Q703607) (← links)
- Brooks' theorem via the Alon-Tarsi theorem (Q712277) (← links)
- Three-coloring triangle-free graphs on surfaces. II: 4-critical graphs in a disk (Q723878) (← links)
- Cycles of length three and four in tournaments (Q778712) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Fullerene graphs have exponentially many perfect matchings (Q839387) (← links)
- Polynomial-size binary decision diagrams for the exactly half-\(d\)-hyperclique problem reading each input bit twice (Q841618) (← links)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- Colorings of planar graphs with no rainbow faces (Q858112) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- Mixed hypergraphs and other coloring problems (Q868365) (← links)
- The circular chromatic index of flower snarks (Q870047) (← links)
- Packing six \(T\)-joins in plane graphs (Q896004) (← links)
- Coloring even-faced graphs in the torus and the Klein bottle (Q949800) (← links)
- Toughness threshold for the existence of 2-walks in \(K_{4}\)-minor-free graphs (Q960979) (← links)
- Facial colorings using Hall's theorem (Q966152) (← links)
- Distance constrained labelings of planar graphs with no short cycles (Q967308) (← links)
- Graph labellings with variable weights, a survey (Q967309) (← links)
- An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs (Q986112) (← links)
- Equipartite graphs (Q1001434) (← links)
- Randomized strategies for the plurality problem (Q1003477) (← links)
- A combinatorial proof of the removal lemma for groups (Q1024351) (← links)
- A note on antisymmetric flows in graphs (Q1041206) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
- Quickest paths, straight skeletons, and the city Voronoi diagram (Q1424315) (← links)
- Edge-disjoint odd cycles in planar graphs. (Q1425111) (← links)
- On maximum face-constrained coloring of plane graphs with no short face cycles. (Q1426126) (← links)
- A bound on the inducibility of cycles (Q1621427) (← links)
