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 22014-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


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Juraj Stacho