The following pages link to Pavol Hell (Q338573):
Displaying 50 items.
- (Q3424890) (← links)
- Matrix Partitions with Finitely Many Obstructions (Q3439607) (← links)
- A note on the star chromatic number (Q3487411) (← links)
- (Q3496356) (← links)
- Faithful Representations of Graphs by Islands in the Extended Grid (Q3557016) (← links)
- Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms (Q3614191) (← links)
- (Q3615805) (← links)
- (Q3702524) (← links)
- Packings by Complete Bipartite Graphs (Q3728943) (← links)
- (Q3739151) (← links)
- (Q3758852) (← links)
- On Restricted Two-Factors (Q3825107) (← links)
- (Q3826579) (← links)
- The Complexity of Colouring by Semicomplete Digraphs (Q3834066) (← links)
- (Q3842539) (← links)
- On the Edge-sets of Rigid and Corigid Graphs (Q3858298) (← links)
- Cohomomorphisms of graphs and hypergraphs (Q3874251) (← links)
- Parallel Sorting with Constant Time for Comparisons (Q3911406) (← links)
- (Q3916606) (← links)
- (Q3922725) (← links)
- (Q3929772) (← links)
- (Q3941434) (← links)
- (Q3942999) (← links)
- Sorting and Merging in Rounds (Q3956411) (← links)
- Analogues of the Shannon Capacity of a Graph (Q3966167) (← links)
- Broadcasting in Bounded Degree Graphs (Q3989008) (← links)
- Algorithms for Degree Constrained Graph Factors of Minimum Deficiency (Q4033760) (← links)
- (Q4043098) (← links)
- (Q4049082) (← links)
- <i>Corrections</i> : Generalized Ramsey Theory for Graphs V (Q4050628) (← links)
- (Q4065585) (← links)
- (Q4074924) (← links)
- (Q4097314) (← links)
- On the Density of Sets Containing No <i>k</i> -Element Arithmetic Progression of a Certain Kind (Q4111953) (← links)
- (Q4135598) (← links)
- An intermediate value theorem for graphs with given automorphism group (Q4180381) (← links)
- (Q4196449) (← links)
- (Q4200107) (← links)
- (Q4201932) (← links)
- On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs (Q4271622) (← links)
- (Q4432211) (← links)
- Broadcasting in generalized chordal rings (Q4432761) (← links)
- Packing paths in digraphs (Q4432768) (← links)
- List Partitions (Q4443101) (← links)
- Acyclic Homomorphisms and Circular Colorings of Digraphs (Q4443128) (← links)
- Coloring all directed paths in a symmetric tree, with an application to optical networks (Q4539866) (← links)
- Constructions of large planar networks with given degree and diameter (Q4540082) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy (Q4635829) (← links)
- (Q4660723) (← links)