The following pages link to Jan Kratochvíl (Q175587):
Displaying 39 items.
- Testing Planarity of Partially Embedded Graphs (Q4962193) (← links)
- Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs (Q5167767) (← links)
- Graph Drawing (Q5193167) (← links)
- Determining the L(2,1)-Span in Polynomial Space (Q5200500) (← links)
- Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill (Q5200514) (← links)
- MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS (Q5249044) (← links)
- Intersection graphs of homothetic polygons (Q5301023) (← links)
- (Q5387696) (← links)
- Theoretical Computer Science (Q5395075) (← links)
- (Q5403059) (← links)
- Can they cross? and how? (Q5404410) (← links)
- A kuratowski-type theorem for planarity of partially embedded graphs (Q5404414) (← links)
- (Q5417619) (← links)
- On Switching to <i>H</i>‐Free Graphs (Q5417832) (← links)
- Moving Vertices to Make Drawings Plane (Q5452215) (← links)
- Clustered Planarity: Small Clusters in Eulerian Graphs (Q5452233) (← links)
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems (Q5458528) (← links)
- (Q5481339) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710822) (← links)
- Automata, Languages and Programming (Q5716789) (← links)
- Computing and Combinatorics (Q5717008) (← links)
- Parameterized Complexity of Generalized Domination Problems (Q5851100) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902530) (← links)
- Representing graphs by disks and balls (a survey of recognition-complexity results) (Q5931448) (← links)
- Efficient algorithms for graphs with few \(P_4\)'s (Q5937917) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)
- Guest editors' foreword (Q5971208) (← links)
- Drawing Simultaneously Embedded Graphs with Few Bends (Q6066464) (← links)
- List covering of regular multigraphs with semi-edges (Q6119831) (← links)
- Complexity of graph covering problems (Q6184361) (← links)
- List covering of regular multigraphs with semi-edges (Q6396064) (← links)
- Computational Complexity of Covering Disconnected Multigraphs (Q6439886) (← links)
- Hamiltonian path and Hamiltonian cycle are solvable in polynomial time in graphs of bounded independence number (Q6513060) (← links)
- On a Combinatorial Problem Arising in Machine Teaching (Q6520765) (← links)
- On the Structure of Hamiltonian Graphs with Small Independence Number (Q6524851) (← links)
- Three edge-disjoint plane spanning paths in a point set (Q6560157) (← links)
- The parametrized complexity of the segment number (Q6618253) (← links)
- Computational complexity of covering disconnected multigraphs (Q6633538) (← links)
- Recognizing \(H\)-graphs -- beyond circular-arc graphs (Q6647628) (← links)
