The following pages link to Daniel Král' (Q273100):
Displaying 50 items.
- (Q4633818) (← links)
- Graphic TSP in cubic graphs (Q4636625) (← links)
- Optimal‐size clique transversals in chordal graphs (Q4646950) (← links)
- Hamilton cycles in strong products of graphs (Q4676590) (← links)
- (Q4708589) (← links)
- (Q4779166) (← links)
- (Q4782746) (← links)
- Min-Max Relations for Odd Cycles in Planar Graphs (Q4899031) (← links)
- A New Bound for the 2/3 Conjecture (Q4921568) (← links)
- First order limits of sparse graphs: Plane trees and path-width (Q4978432) (← links)
- Recovering sparse graphs (Q5005129) (← links)
- Inducibility and universality for trees (Q5051466) (← links)
- Permutations with fixed pattern densities (Q5113938) (← links)
- Finitely forcible graphons with an almost arbitrary structure (Q5126772) (← links)
- Analytic representations of large graphs (Q5149167) (← links)
- Matchings and Nonrainbow Colorings (Q5189521) (← links)
- 6-Critical Graphs on the Klein Bottle (Q5189524) (← links)
- Decomposing Graphs into Edges and Triangles (Q5222546) (← links)
- Six-Critical Graphs on the Klein Bottle (Q5301014) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311103) (← links)
- Algorithm Theory - SWAT 2004 (Q5315376) (← links)
- Coloring Powers of Chordal Graphs (Q5317560) (← links)
- FO Model Checking of Interval Graphs (Q5327438) (← links)
- First-Order Convergence and Roots (Q5366887) (← links)
- Hereditary properties of permutations are strongly testable (Q5384048) (← links)
- Coloring Triangle-Free Graphs on Surfaces (Q5387740) (← links)
- The Last Fraction of a Fractional Conjecture (Q5392921) (← links)
- Testing first-order properties for subclasses of sparse graphs (Q5395732) (← links)
- Tough spiders (Q5434242) (← links)
- Hamilton cycles in prisms (Q5434258) (← links)
- Coloring graphs from lists with bounded size of their union (Q5462386) (← links)
- (Q5466086) (← links)
- Automata, Languages and Programming (Q5466486) (← links)
- The last excluded case of Dirac's map‐color theorem for choosability (Q5469029) (← links)
- A Brooks-Type Theorem for the Generalized List T-Coloring (Q5470781) (← links)
- (Q5480727) (← links)
- On the number of intersections of two polygons. (Q5488104) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492893) (← links)
- (Q5501275) (← links)
- A note on group colorings (Q5706477) (← links)
- STACS 2005 (Q5710675) (← links)
- Packing directed cycles through a specified vertex set (Q5741735) (← links)
- Infinite‐dimensional finitely forcible graphon (Q5741849) (← links)
- The Channel Assignment Problem with Variable Weights (Q5757386) (← links)
- Algorithms for Classes of Graphs with Bounded Expansion (Q5851090) (← links)
- Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming (Q5864669) (← links)
- Circular edge-colorings of cubic graphs with girth six (Q5891228) (← links)
- Counting flags in triangle-free digraphs (Q5891231) (← links)
- Long cycles in fullerene graphs (Q5896980) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5897564) (← links)
