Juraj Stacho

Available identifiers

zbMath Open stacho.jurajMaRDI QIDQ344832

List of research outcomes

Publication	Date of Publication	Type
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs	2021-04-01	Paper
3-Colorable Subclasses of $P_8$-Free Graphs	2018-05-18	Paper
Complexity of simplicial homology and independence complexes of chordal graphs	2018-01-19	Paper
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm	2017-10-05	Paper
4‐Coloring P 6 ‐Free Graphs with No Induced 5‐Cycles	2017-04-21	Paper
Max point-tolerance graphs	2016-11-24	Paper
Bichain graphs: geometric model and universal graphs	2015-12-10	Paper
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard	2015-09-09	Paper
Constraint Satisfaction with Counting Quantifiers	2015-06-18	Paper
Stable-\(\Pi\) partitions of graphs	2015-02-06	Paper
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number	2015-01-21	Paper
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs	2014-09-26	Paper
Algorithmic complexity of finding cross-cycles in flag complexes	2014-08-07	Paper
Constraint Satisfaction with Counting Quantifiers 2	2014-06-24	Paper
The vertex leafage of chordal graphs	2014-04-02	Paper
A decomposition theorem for chordal graphs and its applications	2013-10-10	Paper
Linear algorithms for chordal graphs of bounded directed vertex leafage	2013-07-04	Paper
Unique perfect phylogeny is intractable	2013-04-17	Paper
3-colouring AT-free graphs in polynomial time	2013-01-28	Paper
On edge-sets of bicliques in graphs	2012-11-22	Paper
Obstructions to chordal circular-arc graphs of small independence number	2012-10-21	Paper
Constraint Satisfaction with Counting Quantifiers	2012-09-10	Paper
Reduced clique graphs of chordal graphs	2012-05-04	Paper
Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid	2011-12-16	Paper
Dichotomy for tree-structured trigraph list homomorphism problems	2011-08-10	Paper
Unique Perfect Phylogeny Is NP-Hard	2011-06-29	Paper
3-Colouring AT-Free Graphs in Polynomial Time	2010-12-09	Paper
Polynomial-Time Algorithm for the Leafage of Chordal Graphs	2009-10-29	Paper
On \(P_4\)-transversals of chordal graphs	2009-01-28	Paper
Polarity of chordal graphs	2008-11-19	Paper
On Injective Colourings of Chordal Graphs	2008-04-15	Paper
On 2-Subcolourings of Chordal Graphs	2008-04-15	Paper

Research outcomes over time

This page was built for person: Juraj Stacho