The following pages link to Jiří Fiala (Q190515):
Displaying 50 items.
- An universality argument for graph homomorphisms (Q322345) (← links)
- Distance three labelings of trees (Q415278) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Parameterized complexity of coloring problems: treewidth versus vertex cover (Q534566) (← links)
- On distance constrained labeling of disk graphs (Q703553) (← links)
- Universality of intervals of line graph order (Q740276) (← links)
- A complete complexity classification of the role assignment problem (Q817773) (← links)
- Cantor--Bernstein type theorem for locally constrained graph homomorphisms (Q852701) (← links)
- Complexity of the packing coloring problem for trees (Q972338) (← links)
- Comparing universal covers in polynomial time (Q987372) (← links)
- The packing chromatic number of infinite product graphs (Q1024309) (← links)
- 3-connected reduction for regular graph covers (Q1663806) (← links)
- Gaps in full homomorphism order (Q1689952) (← links)
- Systems of distant representatives (Q1764814) (← links)
- Generalized list \(T\)-colorings of cycles (Q1775057) (← links)
- (Q1862126) (redirect page) (← links)
- On-line coloring of geometric intersection graphs (Q1862127) (← links)
- Computational complexity of covering disconnected multigraphs (Q2140489) (← links)
- List covering of regular multigraphs (Q2169958) (← links)
- Reconfiguration graph for vertex colourings of weakly chordal graphs (Q2286594) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Detecting induced star-like minors in polynomial time (Q2376792) (← links)
- Fractal property of the graph homomorphism order (Q2403692) (← links)
- Parameterized complexity of distance labeling and uniform channel assignment problems (Q2413966) (← links)
- Locally constrained graph homomorphisms and equitable partitions (Q2427537) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q2428671) (← links)
- On the computational complexity of partial covers of theta graphs (Q2482109) (← links)
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems (Q2817849) (← links)
- Locally Constrained Homomorphisms on Graphs of Bounded Treewidth and Bounded Degree (Q2842779) (← links)
- Linear-Time Algorithms for Scattering Number and Hamilton-Connectivity of Interval Graphs (Q2864296) (← links)
- The \(k\)-in-a-path problem for claw-free graphs (Q3113764) (← links)
- (Q3356811) (← links)
- (Q3439665) (← links)
- Distance Constrained Labelings of Trees (Q3502639) (← links)
- Comparing Universal Covers in Polynomial Time (Q3503635) (← links)
- Computational Complexity of the Distance Constrained Labeling Problem for Trees (Extended Abstract) (Q3521928) (← links)
- Locally Injective Graph Homomorphism: Lists Guarantee Dichotomy (Q3522938) (← links)
- Parameterized Complexity of Coloring Problems: Treewidth versus Vertex Cover (Q3630207) (← links)
- (Q3864477) (← links)
- (Q4132194) (← links)
- NP completeness of the edge precoloring extension problem on bipartite graphs (Q4406072) (← links)
- (Q4414498) (← links)
- (Q4422267) (← links)
- (Q4427860) (← links)
- Graph Subcolorings: Complexity and Algorithms (Q4443116) (← links)
- (Q4448371) (← links)
- (Q4448755) (← links)
- (Q4449222) (← links)
- (Q4474120) (← links)
- On Vertex- and Empty-Ply Proximity Drawings (Q4625098) (← links)
