The following pages link to Pavol Hell (Q338573):
Displaying 50 items.
- Distance-two colourings of Barnette graphs (Q2225415) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- Influence diffusion in social networks under time window constraints (Q2345457) (← links)
- Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms (Q2346339) (← links)
- Optimal decomposition by clique separators (Q2366013) (← links)
- Gadget classification (Q2366217) (← links)
- On the density of trigraph homomorphisms (Q2373444) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Correspondence homomorphisms to reflexive graphs (Q2413143) (← links)
- Minimal obstructions to 2-polar cographs (Q2414467) (← links)
- A dichotomy for minimum cost graph homomorphisms (Q2427539) (← links)
- On the adaptable chromatic number of graphs (Q2427540) (← links)
- Matrix partitions of perfect graphs (Q2433706) (← links)
- Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
- On the complexity of the 3-kernel problem in some classes of digraphs (Q2442275) (← links)
- On realizations of point determining graphs, and obstructions to full homomorphisms (Q2477389) (← links)
- Oriented star packings (Q2483479) (← links)
- Graph partitions with prescribed patterns (Q2509761) (← links)
- Join colourings of chordal graphs (Q2515589) (← links)
- Every finite graph is a full subgraph of a rigid graph (Q2550402) (← links)
- Graph decompositions, handcuffed prisoners and balanced p-designs (Q2556864) (← links)
- Full embeddings into some categories of graphs (Q2559488) (← links)
- Absolute planar retracts and the four colour conjecture (Q2562866) (← links)
- A generalization of the theorem of Lekkerkerker and Boland (Q2568478) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Matrix partitions of split graphs (Q2636832) (← links)
- On the complexity of coloring areflexive \(h\)-ary relations with given permutation group (Q2715944) (← links)
- On generalized split graphs (Q2741477) (← links)
- A Fully dynamic algorithm for recognizing and representing proper interval graphs (Q2784453) (← links)
- On homomorphisms to edge-coloured cycles (Q2816064) (← links)
- Graph packings (Q2816101) (← links)
- Minimum Cost Homomorphisms with Constrained Costs (Q2817862) (← links)
- Complexity of graph partition problems (Q2819579) (← links)
- Adjusted interval digraphs (Q2839215) (← links)
- Cycle transversals in bounded degree graphs (Q2840538) (← links)
- Partitioning chordal graphs (Q2857366) (← links)
- Influence Diffusion in Social Networks under Time Window Constraints (Q2868640) (← links)
- Approximation of Minimum Cost Homomorphisms (Q2912876) (← links)
- Ordering without Forbidden Patterns (Q2921442) (← links)
- Two algorithms for general list matrix partitions (Q2921752) (← links)
- Absolute Retracts and Varieties of Reflexive Graphs (Q3030858) (← links)
- On the Complexity of General Graph Factor Problems (Q3038617) (← links)
- Retractions to Pseudoforests (Q3084215) (← links)
- Blocking Quadruple: A New Obstruction to Circular-Arc Graphs (Q3192153) (← links)
- Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case (Q3192166) (← links)
- (Q3216676) (← links)
- The complexity of finding generalized paths in tournaments (Q3315014) (← links)
- (Q3337511) (← links)
- Near-Unanimity Functions and Varieties of Reflexive Graphs (Q3393427) (← links)
- (Q3424776) (← links)
