50 results on '"Kratochvíl, Jan"'
Search Results
2. Computational Complexity of Covering Disconnected Multigraphs
3. Bounded Stub Resolution for Some Maximal 1-Planar Graphs
4. Cops and Robbers on String Graphs
5. Extending Partial Representations of Proper and Unit Interval Graphs
6. Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
7. Computational Complexity of Covering Three-Vertex Multigraphs
8. Algorithmic Aspects of Regular Graph Covers with Applications to Planar Graphs
9. Drawing Simultaneously Embedded Graphs with Few Bends
10. Planar Embeddings with Small and Uniform Faces
11. Cops and Robbers on Intersection Graphs
12. MSOL Restricted Contractibility to Planar Graphs
13. Beyond Homothetic Polygons: Recognition and Maximum Clique
14. Extending Partial Representations of Function Graphs and Permutation Graphs
15. Extending Partial Representations of Subclasses of Chordal Graphs
16. Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
17. Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width
18. Determining the L(2,1)-Span in Polynomial Space
19. Faithful Representations of Graphs by Islands in the Extended Grid
20. The Planar Slope Number of Planar Partial 3-Trees of Bounded Degree
21. Parameterized Complexity of Generalized Domination Problems
22. Clustered Planarity: Embedded Clustered Graphs with Two-Component Clusters
23. Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract)
24. Fixed Parameter Tractability of Independent Set in Segment Intersection Graphs
25. Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy
26. Distance Constrained Labelings of Graphs of Bounded Treewidth
27. Elegant Distance Constrained Labelings of Trees
28. Two Results on Intersection Graphs of Polygons
29. Complexity of Hypergraph Coloring and Seidel’s Switching
30. On the b-Chromatic Number of Graphs
31. Geometric Systems of Disjoint Representatives
32. Planar Graph Coloring with Forbidden Subgraphs: Why Trees and Paths Are Dangerous
33. Complexity of Partial Covers of Graphs
34. Complexity Note on Mixed Hypergraphs
35. Complexity of Coloring Graphs without Forbidden Induced Subgraphs
36. Coloring Mixed Hypertrees
37. New Branchwidth Territories
38. Mod-2 Independence and Domination in Graphs
39. Fixed-Parameter Complexity of λ-Labelings
40. Crossing Number of Abstract Topological Graphs
41. Rankings of Directed Graphs
42. Complexity of colored graph covers I. Colored directed multigraphs
43. Computational complexity of the Krausz dimension of graphs
44. Intersection graphs of noncrossing arc-connected sets in the plane
45. Grid intersection and box intersection graphs on surfaces
46. Complexity of graph covering problems
47. Computational Complexity of Generalized Domination: A Complete Dichotomy for Chordal Graphs
48. Moving Vertices to Make Drawings Plane
49. Clustered Planarity: Small Clusters in Eulerian Graphs
50. Exact Algorithms for L(2,1)-Labeling of Graphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.