Juraj Stacho

From MaRDI portal
Person:344832

Available identifiers

zbMath Open stacho.jurajMaRDI QIDQ344832

List of research outcomes





PublicationDate of PublicationType
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs2021-04-01Paper
3-colorable subclasses of \(P_8\)-free graphs2018-05-18Paper
Complexity of simplicial homology and independence complexes of chordal graphs2018-01-19Paper
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm2017-10-05Paper
4‐Coloring P 6 ‐Free Graphs with No Induced 5‐Cycles2017-04-21Paper
Max point-tolerance graphs2016-11-24Paper
Bichain graphs: geometric model and universal graphs2015-12-10Paper
Contact representations of planar graphs: extending a partial representation is hard2015-09-09Paper
Constraint satisfaction with counting quantifiers2015-06-18Paper
Stable-\(\Pi\) partitions of graphs2015-02-06Paper
Vertex ordering characterizations of graphs of bounded asteroidal number2015-01-21Paper
Blocking quadruple: a new obstruction to circular-arc graphs2014-09-26Paper
Algorithmic complexity of finding cross-cycles in flag complexes2014-08-07Paper
Constraint satisfaction with counting quantifiers. II2014-06-24Paper
The vertex leafage of chordal graphs2014-04-02Paper
A decomposition theorem for chordal graphs and its applications2013-10-10Paper
Linear algorithms for chordal graphs of bounded directed vertex leafage2013-07-04Paper
Unique perfect phylogeny is intractable2013-04-17Paper
3-colouring AT-free graphs in polynomial time2013-01-28Paper
On edge-sets of bicliques in graphs2012-11-22Paper
Obstructions to chordal circular-arc graphs of small independence number2012-10-21Paper
Constraint satisfaction with counting quantifiers2012-09-10Paper
Reduced clique graphs of chordal graphs2012-05-04Paper
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid2011-12-16Paper
Dichotomy for tree-structured trigraph list homomorphism problems2011-08-10Paper
Unique perfect phylogeny is NP-hard2011-06-29Paper
3-colouring AT-free graphs in polynomial time2010-12-09Paper
Polynomial-Time Algorithm for the Leafage of Chordal Graphs2009-10-29Paper
On \(P_4\)-transversals of chordal graphs2009-01-28Paper
Polarity of chordal graphs2008-11-19Paper
On Injective Colourings of Chordal Graphs2008-04-15Paper
On 2-Subcolourings of Chordal Graphs2008-04-15Paper

Research outcomes over time

This page was built for person: Juraj Stacho