Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Pavol Hell - MaRDI portal

Pavol Hell

From MaRDI portal
(Redirected from Person:186172)
Person:338573

Available identifiers

zbMath Open hell.pavolDBLPh/PavolHellWikidataQ16853380 ScholiaQ16853380MaRDI QIDQ338573

List of research outcomes





PublicationDate of PublicationType
Trees with minimum weighted Szeged index2024-10-30Paper
Obituary: Gert Sabidussi 1929--20222024-10-22Paper
Min orderings and list homomorphism dichotomies for graphs and signed graphs2024-08-02Paper
Finding an antidirected Hamiltonian path starting with a forward arc from a given vertex of a tournament2024-07-05Paper
Bi-arc digraphs: recognition algorithm and applications2024-05-31Paper
Strong Cocomparability Graphs and Slash-Free Orderings of Matrices2024-02-27Paper
https://portal.mardi4nfdi.de/entity/Q61475142024-01-15Paper
Min orderings and list homomorphism dichotomies for signed and unsigned graphs2023-07-26Paper
List homomorphisms to separable signed graphs2023-06-10Paper
On the kernel and related problems in interval digraphs2023-06-05Paper
List homomorphisms to separable signed graphs2023-05-08Paper
Template-driven rainbow coloring of proper interval graphs2023-02-22Paper
List homomorphism problems for signed trees2023-01-17Paper
Graph homomorphisms2022-12-21Paper
Describing hereditary properties by forbidden circular orderings2022-11-16Paper
https://portal.mardi4nfdi.de/entity/Q50891812022-07-18Paper
Template-driven rainbow coloring of proper interval graphs2022-03-24Paper
In praise of homomorphisms2021-12-20Paper
Describing hereditary properties by forbidden circular orderings2021-11-30Paper
https://portal.mardi4nfdi.de/entity/Q50051722021-08-04Paper
Vertex arboricity of cographs2021-06-23Paper
Strong Chordality of Graphs with Possible Loops2021-03-17Paper
Distance-two colourings of Barnette graphs2021-02-08Paper
Min-Orderable Digraphs2020-10-28Paper
Bipartite Analogues of Comparability and Cocomparability Graphs2020-10-27Paper
Partitioning cographs into two forests and one independent set2020-07-21Paper
Minimum Weighted Szeged Index Trees2020-07-20Paper
Hamiltonian cycles in covering graphs of trees2020-06-05Paper
Complexity of correspondence \(H\)-colourings2020-05-29Paper
List homomorphism problems for signed trees2020-05-12Paper
Strongly chordal digraphs and $\Gamma$-free matrices2019-09-08Paper
Complexity of acyclic colorings of graphs and digraphs with degree and girth constraints2019-06-28Paper
Space complexity of list H-colouring: a dichotomy2019-06-20Paper
Minimal obstructions to 2-polar cographs2019-05-17Paper
Colouring paths in directed symmetric trees with applications to WDM routing2018-07-04Paper
Descriptive Complexity of List H-Coloring Problems in Logspace: A Refined Dichotomy2018-04-23Paper
Correspondence homomorphisms to reflexive graphs2018-04-09Paper
Hamiltonian cycles in covering graphs of trees2018-03-26Paper
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm2017-10-05Paper
https://portal.mardi4nfdi.de/entity/Q53651492017-09-29Paper
The complexity of tropical graph homomorphisms2017-07-27Paper
Strict chordal and strict split digraphs2017-03-15Paper
The complexity of signed graph and edge-coloured graph homomorphisms2016-12-14Paper
Ferrers dimension of grid intersection graphs2016-11-24Paper
Complexity of coloring graphs without paths and cycles2016-11-24Paper
Colourings, homomorphisms, and partitions of transitive digraphs2016-11-07Paper
Complexity of graph partition problems2016-09-29Paper
Minimum Cost Homomorphisms with Constrained Costs2016-09-02Paper
Bi-Arc Digraphs and Conservative Polymorphisms2016-08-11Paper
https://portal.mardi4nfdi.de/entity/Q28160642016-07-01Paper
https://portal.mardi4nfdi.de/entity/Q28161012016-07-01Paper
Minimal digraph obstructions for small matrices2016-05-31Paper
Join colourings of chordal graphs2015-08-05Paper
Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms2015-06-01Paper
Influence diffusion in social networks under time window constraints2015-05-22Paper
https://portal.mardi4nfdi.de/entity/Q29217522014-10-13Paper
Ordering without Forbidden Patterns2014-10-08Paper
Colouring, constraint satisfaction, and complexity2014-10-07Paper
\(H\)-coloring degree-bounded (acyclic) digraphs2014-10-06Paper
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs2014-09-26Paper
Graphs Admitting $k$-NU Operations. Part 2: The Irreflexive Case2014-09-26Paper
Connected obstructions to full graph homomorphisms2014-09-02Paper
Recognition and characterization of chronological interval digraphs2014-08-14Paper
Graph partitions with prescribed patterns2014-07-29Paper
Intersection Dimension of Bipartite Graphs2014-04-16Paper
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case2014-04-10Paper
On the complexity of the 3-kernel problem in some classes of digraphs2014-04-02Paper
Complexity of Coloring Graphs without Paths and Cycles2014-03-31Paper
https://portal.mardi4nfdi.de/entity/Q54030542014-03-25Paper
Semilattice polymorphisms and chordal graphs2014-03-25Paper
On the completeness of a generalized matching problem2014-03-14Paper
Matrix partitions of split graphs2014-02-18Paper
A simple combinatorial interpretation of certain generalized Bell and Stirling numbers2014-01-27Paper
Influence Diffusion in Social Networks under Time Window Constraints2013-12-17Paper
Obstructions to partitions of chordal graphs2013-12-06Paper
https://portal.mardi4nfdi.de/entity/Q28573662013-11-01Paper
Cycle transversals in bounded degree graphs2013-07-19Paper
Adjusted Interval Digraphs2013-07-04Paper
Small H-Coloring Problems for Bounded Degree Digraphs2013-06-11Paper
Monotone Proper Interval Digraphs and Min-Max Orderings2013-04-09Paper
The Dichotomy of Minimum Cost Homomorphism Problems for Digraphs2013-04-09Paper
Counting Partitions of Graphs2013-03-21Paper
On edge-sets of bicliques in graphs2012-11-22Paper
Obstructions to chordal circular-arc graphs of small independence number2012-10-21Paper
Approximation of Minimum Cost Homomorphisms2012-09-25Paper
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms2012-05-11Paper
Dichotomy for tree-structured trigraph list homomorphism problems2011-08-10Paper
Particionamento de Grafos Cordais em Conjuntos Independentes e Cliques2011-04-04Paper
Retractions to Pseudoforests2011-03-15Paper
Messy broadcasting - decentralized broadcast schemes with limited knowledge2011-03-10Paper
Faithful Representations of Graphs by Islands in the Extended Grid2010-04-27Paper
Adaptable chromatic number of graph products2009-12-15Paper
Linear-time certifying algorithms for near-graphical sequences2009-12-15Paper
Near-Unanimity Functions and Varieties of Reflexive Graphs2009-08-20Paper
Extension problems with degree bounds2009-06-30Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Matrix partitions with finitely many obstructions2009-04-07Paper
https://portal.mardi4nfdi.de/entity/Q36158052009-03-24Paper
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms2009-03-16Paper
Polarity of chordal graphs2008-11-19Paper
A dichotomy for minimum cost graph homomorphisms2008-05-13Paper
On the adaptable chromatic number of graphs2008-05-13Paper
Oriented star packings2008-04-28Paper
Minimum Cost Homomorphisms to Reflexive Digraphs2008-04-15Paper
On Injective Colourings of Chordal Graphs2008-04-15Paper
On realizations of point determining graphs, and obstructions to full homomorphisms2008-03-13Paper
On the density of trigraph homomorphisms2007-07-19Paper
Matrix Partitions with Finitely Many Obstructions2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q34247762007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34248902007-03-05Paper
List homomorphisms of graphs with bounded degrees2007-02-13Paper
The structure of bi-arc trees2007-02-13Paper
Digraph matrix partitions and trigraph homomorphisms2007-01-09Paper
Matrix partitions of perfect graphs2006-10-30Paper
The k‐piece packing problem2006-09-06Paper
Full Constraint Satisfaction Problems2006-06-01Paper
List matrix partitions of chordal graphs2006-03-20Paper
Packing \(r\)-cliques in weighted chordal graphs2006-03-07Paper
Independent packings in structured graphs2006-01-13Paper
A generalization of the theorem of Lekkerkerker and Boland2005-10-10Paper
Certifying LexBFS Recognition Algorithms for Proper Interval Graphs and Proper Interval Bigraphs2005-09-16Paper
https://portal.mardi4nfdi.de/entity/Q46607232005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q48285162004-11-19Paper
https://portal.mardi4nfdi.de/entity/Q48143492004-09-07Paper
Spanning spiders and light-splitting switches2004-08-19Paper
Polychromatic cliques2004-08-19Paper
Interval bigraphs and circular arc graphs2004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q47371702004-08-11Paper
Partitioning chordal graphs into independent sets and cliques2004-08-06Paper
List Partitions2004-01-08Paper
Acyclic Homomorphisms and Circular Colorings of Digraphs2004-01-08Paper
Broadcasting in generalized chordal rings2003-10-29Paper
Packing paths in digraphs2003-10-29Paper
Bi‐arc graphs and the complexity of list homomorphisms2003-03-19Paper
https://portal.mardi4nfdi.de/entity/Q44322112003-01-01Paper
High-girth graphs avoiding a minor are nearly bipartite2002-12-10Paper
On the History of the Minimum Spanning Tree Problem2002-11-25Paper
On nice graphs2002-08-08Paper
Constructions of large planar networks with given degree and diameter2002-07-21Paper
Coloring all directed paths in a symmetric tree, with an application to optical networks2002-07-11Paper
Homomorphisms to powers of digraphs2002-05-21Paper
Antidirected Hamiltonian paths between specified vertices of a tournament2002-05-15Paper
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs2002-04-23Paper
https://portal.mardi4nfdi.de/entity/Q27414772001-10-24Paper
The complexity of \(H\)-colouring of bounded degree graphs2001-03-04Paper
https://portal.mardi4nfdi.de/entity/Q49446812000-09-15Paper
List homomorphisms and circular arc graphs2000-05-14Paper
https://portal.mardi4nfdi.de/entity/Q38425391998-08-16Paper
List homomorphisms to reflexive graphs1998-08-10Paper
Optimal wavelength-routed multicasting1998-07-28Paper
Duality and Polynomial Testing of Tree Homomorphisms1997-12-08Paper
The complexity of restricted graph homomorphisms1997-10-09Paper
Two remarks on circular arc graphs1997-08-18Paper
Complexity of tree homomorphisms1997-08-18Paper
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs1997-01-22Paper
Rounding in symmetric matrices and undirected graphs1996-10-09Paper
https://portal.mardi4nfdi.de/entity/Q48786641996-06-24Paper
Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs1996-06-04Paper
On homomorphisms to acyclic local tournaments1996-05-13Paper
Largest planar graphs of diameter two and fixed maximum degree1996-04-23Paper
https://portal.mardi4nfdi.de/entity/Q48634191996-04-22Paper
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs1996-04-08Paper
The Existence of Homomorphisms to Oriented Cycles1996-02-12Paper
On the ultimate independence ratio of a graph1996-01-07Paper
Equicovering matroids by distinct bases1995-09-28Paper
Homomorphisms to oriented paths1995-08-27Paper
Large planar graphs with given diameter and maximum degree1995-08-27Paper
Hereditarily hard \(H\)-colouring problems1995-07-19Paper
Packing problems in edge-colored graphs1995-02-14Paper
Mutiplicativity of oriented cycles1995-01-02Paper
On chordal proper circular arc graphs1994-05-05Paper
Independence ratios of graph powers1994-05-05Paper
Homomorphisms to oriented cycles1994-04-18Paper
On even factorizations and the chromatic index of the Kautz and de Bruijn digraphs1993-12-10Paper
Biography of Martin Farber, 1951--19891993-11-30Paper
Absolute reflexive retracts and absolute bipartite retracts1993-11-30Paper
On the complexity of colouring by superdigraphs of bipartite graphs1993-10-14Paper
The core of a graph1993-10-14Paper
https://portal.mardi4nfdi.de/entity/Q42019321993-09-06Paper
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency1993-05-16Paper
Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs1993-05-16Paper
Universality of \(A\)-mote graphs1993-05-16Paper
Achromatic numbers and graph operations1993-01-17Paper
Sparse broadcast graphs1992-09-27Paper
Broadcasting in Bounded Degree Graphs1992-06-28Paper
Images of rigid digraphs1991-01-01Paper
A note on the star chromatic number1990-01-01Paper
A simple existence criterion for \((g<f)\)-factors1990-01-01Paper
The effect of two cycles on the complexity of colourings by directed graphs1990-01-01Paper
On the complexity of H-coloring1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34963561989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38265791989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47338891989-01-01Paper
On Restricted Two-Factors1988-01-01Paper
The Complexity of Colouring by Semicomplete Digraphs1988-01-01Paper
On multiplicative graphs and the product conjecture1988-01-01Paper
Broadcasting in one dimension1988-01-01Paper
Absolute Retracts and Varieties of Reflexive Graphs1987-01-01Paper
On the problem of bandsize1987-01-01Paper
Packings by Complete Bipartite Graphs1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37391511986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588521986-01-01Paper
Concerning the achromatic number of graphs1986-01-01Paper
A note on f-factors in directed and undirected multigraphs1986-01-01Paper
Jump number and width1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32166761985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37025241985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51849281984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33375111984-01-01Paper
Packings by cliques and by finite families of graphs1984-01-01Paper
On the Complexity of General Graph Factor Problems1983-01-01Paper
The complexity of finding generalized paths in tournaments1983-01-01Paper
Counterexamples to theorems of Menger type for the diameter1983-01-01Paper
Sorting and Merging in Rounds1982-01-01Paper
Analogues of the Shannon Capacity of a Graph1982-01-01Paper
Parallel Sorting with Constant Time for Comparisons1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297721981-01-01Paper
On generalized matching problems1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39227251980-01-01Paper
On the Edge-sets of Rigid and Corigid Graphs1979-01-01Paper
Cohomomorphisms of graphs and hypergraphs1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39166061979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39414341979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39429991979-01-01Paper
An intermediate value theorem for graphs with given automorphism group1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41964491978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42001071978-01-01Paper
Homomorphisms of graphs and of their orientations1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40973141976-01-01Paper
On the Density of Sets Containing No k -Element Arithmetic Progression of a Certain Kind1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41355981976-01-01Paper
Graph with given achromatic number1976-01-01Paper
Corrections : Generalized Ramsey Theory for Graphs V1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40655851975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40749241975-01-01Paper
Some results on the Oberwolfach problem. (Decomposition of complete graphs into isomorphic quadratic factors.)1975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40490821974-01-01Paper
Generalized Ramsey Theory for Graphs V. the Ramsey Number of a Digraph1974-01-01Paper
On some strongly rigid families of graphs and the full embeddings they induce1974-01-01Paper
Absolute planar retracts and the four colour conjecture1974-01-01Paper
Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56296531972-01-01Paper
Graph decompositions, handcuffed prisoners and balanced p-designs1972-01-01Paper
Full embeddings into some categories of graphs1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40430981971-01-01Paper
Every finite graph is a full subgraph of a rigid graph1971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56029541970-01-01Paper
Graphs and k-Societies1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595781970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56688461970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55541591968-01-01Paper

Research outcomes over time

This page was built for person: Pavol Hell