The following pages link to Daniel Král' (Q273100):
Displaying 50 items.
- Cyclic coloring of plane graphs with maximum face size 16 and 17 (Q2662786) (← links)
- Three-coloring triangle-free graphs on surfaces. VII. A linear-time algorithm (Q2664564) (← links)
- (Q2766689) (← links)
- Third case of the cyclic coloring conjecture (Q2797092) (← links)
- Hadwiger's conjecture (Q2822591) (← links)
- Joins, coronas and their vertex-edge Wiener polynomials (Q2825835) (← links)
- On the minimum vertex \(k\)-path cover of trees (Q2831594) (← links)
- Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
- On primal graphs with maximum degree 2 (Q2875908) (← links)
- Extending fractional precolorings (Q2910941) (← links)
- Non-three-colourable common graphs exist (Q2911071) (← links)
- Two algorithms for general list matrix partitions (Q2921752) (← links)
- Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
- (Q3043724) (← links)
- Coloring plane graphs with independent crossings (Q3055915) (← links)
- Short Cycle Covers of Graphs with Minimum Degree Three (Q3084229) (← links)
- Limit Behavior of Locally Consistent Constraint Satisfaction Problems (Q3094950) (← links)
- Domination number of cubic graphs with large girth (Q3113283) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
- Deciding First Order Properties of Matroids (Q3167015) (← links)
- Fractional colorings of cubic graphs with large girth (Q3225133) (← links)
- Characterization of quasirandom permutations by a pattern sum (Q3386522) (← links)
- Elusive extremal graphs (Q3389178) (← links)
- Probabilistic strategies for the partition and plurality problems (Q3419612) (← links)
- (Q3424884) (← links)
- Closure for the property of having a hamiltonian prism (Q3427373) (← links)
- Unions of perfect matchings in cubic graphs (Q3439362) (← links)
- Distance Constrained Labelings of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mn>4</mml:mn></mml:msub></mml:math>-minor Free Graphs (Q3439631) (← links)
- Construction of Large Graphs with No Optimal Surjective <i>L</i>(2,1)-Labelings (Q3440271) (← links)
- FO Model Checking of Interval Graphs (Q3460413) (← links)
- Characterization of affine Steiner triple systems and Hall triple systems (Q3503447) (← links)
- Edge-colorings of cubic graphs with elements of point-transitive Steiner triple systems (Q3503448) (← links)
- Labelings of Graphs with Fixed and Variable Edge-Weights (Q3519202) (← links)
- Characterisation Results for Steiner Triple Systems and Their Application to Edge-Colourings of Cubic Graphs (Q3550147) (← links)
- Non-rainbow colorings of 3-, 4- and 5-connected plane graphs (Q3553229) (← links)
- (Q3576657) (← links)
- Optimal Real Number Graph Labellings of a Subfamily of Kneser Graphs (Q3583310) (← links)
- A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs (Q3583319) (← links)
- Decomposition Width of Matroids (Q3587369) (← links)
- Computing Representations of Matroids of Bounded Branch-Width (Q3590936) (← links)
- List colorings with measurable sets (Q3605151) (← links)
- Coloring of Triangle-Free Graphs on the Double Torus (Q3629461) (← links)
- Hamiltonian threshold for strong products of graphs (Q3630836) (← links)
- Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice (Q3648513) (← links)
- (Q4405654) (← links)
- (Q4414494) (← links)
- A Theorem about the Channel Assignment Problem (Q4443099) (← links)
- (Q4448764) (← links)
- (Q4536383) (← links)
- Weak regularity and finitely forcible graph limits (Q4608759) (← links)
