The following pages link to Pavol Hell (Q338573):
Displayed 50 items.
- Item:Q338573 (redirect page) (← links)
- Item:Q186172 (redirect page) (← links)
- Colourings, homomorphisms, and partitions of transitive digraphs (Q338575) (← links)
- Ferrers dimension of grid intersection graphs (Q344841) (← links)
- Complexity of coloring graphs without paths and cycles (Q344861) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- A simple combinatorial interpretation of certain generalized Bell and Stirling numbers (Q394308) (← links)
- Recognition and characterization of chronological interval digraphs (Q396800) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Strict chordal and strict split digraphs (Q516787) (← links)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory (Q579273) (← links)
- Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
- Two remarks on circular arc graphs (Q675889) (← links)
- Biography of Martin Farber, 1951--1989 (Q686241) (← links)
- Absolute reflexive retracts and absolute bipartite retracts (Q686243) (← links)
- Minimum vertex weighted deficiency of \((g,f)\)-factors: A greedy algorithm (Q686268) (← links)
- On the complexity of colouring by superdigraphs of bipartite graphs (Q686279) (← links)
- Endomorphism spectra of graphs (Q686281) (← links)
- The core of a graph (Q686290) (← links)
- Largest planar graphs of diameter two and fixed maximum degree (Q686482) (← links)
- Connected obstructions to full graph homomorphisms (Q740288) (← links)
- \(H\)-coloring degree-bounded (acyclic) digraphs (Q744083) (← links)
- Images of rigid digraphs (Q751667) (← links)
- Generalized homomorphism graph functions (Q753838) (← links)
- A simple existence criterion for \((g<f)\)-factors (Q757439) (← links)
- On linear k-arboricity (Q761470) (← links)
- Partitioning cographs into two forests and one independent set (Q779168) (← links)
- On k-graceful, locally finite graphs (Q790132) (← links)
- Packing \(r\)-cliques in weighted chordal graphs (Q817141) (← links)
- List matrix partitions of chordal graphs (Q817772) (← links)
- In praise of homomorphisms (Q826325) (← links)
- Digraph matrix partitions and trigraph homomorphisms (Q860407) (← links)
- List homomorphisms of graphs with bounded degrees (Q864125) (← links)
- The structure of bi-arc trees (Q864126) (← links)
- The effect of two cycles on the complexity of colourings by directed graphs (Q911612) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- Matrix partitions with finitely many obstructions (Q1010616) (← links)
- Extension problems with degree bounds (Q1028134) (← links)
- Adaptable chromatic number of graph products (Q1045010) (← links)
- Linear-time certifying algorithms for near-graphical sequences (Q1045061) (← links)
- Concerning the achromatic number of graphs (Q1065819) (← links)
- Packings by cliques and by finite families of graphs (Q1068852) (← links)
- Resolvable path designs (Q1070250) (← links)
- A retraction problem in graph theory (Q1073052) (← links)
- A note on f-factors in directed and undirected multigraphs (Q1076696) (← links)
- Maximal tight sets and the Edmonds-Gallai decomposition for matchings (Q1086254) (← links)
- On the problem of bandsize (Q1089353) (← links)
- On the complexity of H-coloring (Q1100215) (← links)
- Jump number and width (Q1103654) (← links)
- On multiplicative graphs and the product conjecture (Q1110530) (← links)