The following pages link to Pavol Hell (Q338573):
Displaying 50 items.
- (Q4733889) (← links)
- (Q4737170) (← links)
- Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph (Q4775886) (← links)
- On the History of the Minimum Spanning Tree Problem (Q4779256) (← links)
- Bi‐arc graphs and the complexity of list homomorphisms (Q4798127) (← links)
- Interval bigraphs and circular arc graphs (Q4810505) (← links)
- Three-and-more set theorems. (Q4814349) (← links)
- (Q4828516) (← links)
- The Existence of Homomorphisms to Oriented Cycles (Q4837649) (← links)
- Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs (Q4857436) (← links)
- On homomorphisms to acyclic local tournaments (Q4857446) (← links)
- (Q4863419) (← links)
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs (Q4877525) (← links)
- (Q4878664) (← links)
- A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs (Q4881292) (← links)
- Duality and Polynomial Testing of Tree Homomorphisms (Q4889961) (← links)
- Counting Partitions of Graphs (Q4909540) (← links)
- Monotone Proper Interval Digraphs and Min-Max Orderings (Q4915188) (← links)
- The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs (Q4915189) (← links)
- Small H-Coloring Problems for Bounded Degree Digraphs (Q4925272) (← links)
- (Q4944681) (← links)
- Vertex arboricity of cographs (Q4995327) (← links)
- (Q5005172) (← links)
- Graph homomorphisms (Q5058677) (← links)
- (Q5089181) (← links)
- Bipartite Analogues of Comparability and Cocomparability Graphs (Q5128518) (← links)
- Min-Orderable Digraphs (Q5130576) (← links)
- (Q5184928) (← links)
- Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs (Q5317569) (← links)
- Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm (Q5363059) (← links)
- (Q5365149) (← links)
- Space complexity of list <i>H</i>-colouring: a dichotomy (Q5383985) (← links)
- Particionamento de Grafos Cordais em Conjuntos Independentes e Cliques (Q5390671) (← links)
- On the completeness of a generalized matching problem (Q5402563) (← links)
- (Q5403054) (← links)
- Complexity of Coloring Graphs without Paths and Cycles (Q5405071) (← links)
- Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case (Q5408602) (← links)
- Intersection Dimension of Bipartite Graphs (Q5410653) (← links)
- Minimum Cost Homomorphisms to Reflexive Digraphs (Q5458527) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- Full Constraint Satisfaction Problems (Q5470753) (← links)
- The <i>k</i>‐piece packing problem (Q5486279) (← links)
- (Q5554159) (← links)
- (Q5602954) (← links)
- Graphs and <i>k</i>-Societies (Q5611042) (← links)
- (Q5629653) (← links)
- (Q5659578) (← links)
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees) (Q5666582) (← links)
- (Q5668846) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
