The following pages link to Daniel Král' (Q273100):
Displaying 43 items.
- 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)
- A new lower bound based on Gromov's method of selecting heavily covered points (Q452003) (← links)
- Fractional total colourings of graphs of high girth (Q651031) (← links)
- On the removal lemma for linear systems over abelian groups (Q691583) (← links)
- Group coloring is \(\Pi_2^{\text{P}}\)-complete (Q817778) (← links)
- Eulerian colorings and the bipartizing matchings conjecture of Fleischner (Q852699) (← links)
- Packing six \(T\)-joins in plane graphs (Q896004) (← links)
- Facial colorings using Hall's theorem (Q966152) (← links)
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs (Q986112) (← links)
- Distance constrained labelings of \(K_{4}\)-minor free graphs (Q1045067) (← links)
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
- An exact algorithm for the channel assignment problem (Q1764816) (← links)
- Hajós' theorem for list coloring (Q1886360) (← links)
- Pancyclicity of strong products of graphs (Q1889847) (← links)
- On the number of pentagons in triangle-free graphs (Q1940382) (← links)
- Rank of divisors on tropical curves (Q2349185) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- List coloring of Cartesian products of graphs (Q2501567) (← links)
- Free binary decision diagrams for the computation of \(\text{EAR}_{ n }\) (Q2506164) (← links)
- Extending partial 5-colorings and 6-colorings in planar graphs (Q2581502) (← links)
- Extending Fractional Precolorings (Q2910941) (← links)
- Non-Three-Colourable Common Graphs Exist (Q2911071) (← links)
- Coloring plane graphs with independent crossings (Q3055915) (← links)
- Short Cycle Covers of Graphs with Minimum Degree Three (Q3084229) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Fractional colorings of cubic graphs with large girth (Q3225133) (← links)
- Unions of perfect matchings in cubic graphs (Q3439362) (← links)
- Characterization of affine Steiner triple systems and Hall triple systems (Q3503447) (← links)
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs (Q3583310) (← links)
- Hamilton cycles in strong products of graphs (Q4676590) (← links)
- A New Bound for the 2/3 Conjecture (Q4921568) (← links)
- Matchings and Nonrainbow Colorings (Q5189521) (← links)
- Six-Critical Graphs on the Klein Bottle (Q5301014) (← links)
- The Last Fraction of a Fractional Conjecture (Q5392921) (← links)
- Testing first-order properties for subclasses of sparse graphs (Q5395732) (← links)
- Coloring graphs from lists with bounded size of their union (Q5462386) (← links)
- The last excluded case of Dirac's map‐color theorem for choosability (Q5469029) (← links)
- Algorithms for Classes of Graphs with Bounded Expansion (Q5851090) (← links)
- Counting flags in triangle-free digraphs (Q5891231) (← links)
- Strong modeling limits of graphs with bounded tree-width (Q6505074) (← links)
- Common graphs with arbitrary chromatic number (Q6506057) (← links)
