The following pages link to Jan Kratochvíl (Q175587):
Displayed 50 items.
- The planar slope number of planar partial 3-trees of bounded degree (Q354442) (← links)
- Fast exact algorithm for \(L(2,1)\)-labeling of graphs (Q393134) (← links)
- Item:Q175587 (redirect page) (← links)
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Parameterized complexity of generalized domination problems (Q415279) (← links)
- Segment representation of a subclass of co-planar graphs (Q418892) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Firefighting on square, hexagonal, and triangular grids (Q465289) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- MSOL restricted contractibility to planar graphs (Q527397) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- Exact algorithms for \(L(2,1)\)-labeling of graphs (Q627538) (← links)
- Branch and recharge: exact algorithms for generalized domination (Q639293) (← links)
- Computational complexity of covering three-vertex multigraphs (Q897866) (← links)
- Sort and Search: exact algorithms for generalized domination (Q989487) (← links)
- Untangling a planar graph (Q1042455) (← links)
- The capture time of a graph (Q1045043) (← links)
- On the computation of the hull number of a graph (Q1045055) (← links)
- Perfect codes over graphs (Q1057833) (← links)
- String graphs. II: Recognizing string graphs is NP-hard (Q1112845) (← links)
- String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← links)
- String graphs requiring exponential representations (Q1121918) (← links)
- Compatible 2-factors (Q1193724) (← links)
- Thresholds for classes of intersection graphs (Q1201264) (← links)
- Satisfiability of co-nested formulas (Q1323332) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- A special planar satisfiability problem and a consequence of its NP- completeness (Q1331895) (← links)
- Intersection dimensions of graph classes (Q1334942) (← links)
- Regular codes in regular graphs are difficult (Q1336698) (← links)
- Intersection graphs of segments (Q1338319) (← links)
- The complexity of induced minors and related problems (Q1346772) (← links)
- Covering and coloring polygon-circle graphs (Q1356563) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- On intersection representations of co-planar graphs (Q1377831) (← links)
- Covering regular graphs (Q1386472) (← links)
- Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245) (← links)
- Item:Q175587 (redirect page) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Cops and robbers on intersection graphs (Q1645059) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Homothetic polygons and beyond: maximal cliques in intersection graphs (Q1671346) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- Systems of distant representatives (Q1764814) (← links)
- On the injective chromatic number of graphs (Q1849923) (← links)
- Mixed hypercacti (Q1883259) (← links)
- A Kuratowski-type theorem for planarity of partially embedded graphs (Q1940706) (← links)
- Independent sets with domination constraints (Q1962033) (← links)
- Hom-properties are uniquely factorizable into irreducible factors (Q1970713) (← links)
- Computational complexity of covering disconnected multigraphs (Q2140489) (← links)