The following pages link to Juraj Stacho (Q344832):
Displaying 31 items.
- Max point-tolerance graphs (Q344833) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- Complexity of simplicial homology and independence complexes of chordal graphs (Q679745) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Polarity of chordal graphs (Q955313) (← links)
- On \(P_4\)-transversals of chordal graphs (Q998435) (← links)
- On edge-sets of bicliques in graphs (Q1759846) (← links)
- 3-colouring AT-free graphs in polynomial time (Q1934316) (← links)
- Unique perfect phylogeny is intractable (Q1945932) (← links)
- Stable-\(\Pi\) partitions of graphs (Q2255049) (← links)
- Dichotomy for tree-structured trigraph list homomorphism problems (Q2275926) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
- Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs (Q2661217) (← links)
- Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage (Q2839217) (← links)
- A Decomposition Theorem for Chordal Graphs and its Applications (Q2851517) (← links)
- Algorithmic complexity of finding cross-cycles in flag complexes (Q2874564) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q2907506) (← links)
- Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number (Q2940988) (← links)
- Contact Representations of Planar Graphs: Extending a Partial Representation is Hard (Q2945185) (← links)
- 4‐Coloring <i>P</i> <sub>6</sub> ‐Free Graphs with No Induced 5‐Cycles (Q2978175) (← links)
- Unique Perfect Phylogeny Is NP-Hard (Q3011849) (← links)
- 3-Colouring AT-Free Graphs in Polynomial Time (Q3060769) (← links)
- Recognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid (Q3104787) (← links)
- Blocking Quadruple: A New Obstruction to Circular-Arc Graphs (Q3192153) (← links)
- Polynomial-Time Algorithm for the Leafage of Chordal Graphs (Q3639254) (← links)
- 3-Colorable Subclasses of $P_8$-Free Graphs (Q4641762) (← links)
- Constraint Satisfaction with Counting Quantifiers 2 (Q4981164) (← links)
- Constraint Satisfaction with Counting Quantifiers (Q5256528) (← links)
- Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm (Q5363059) (← links)
- On Injective Colourings of Chordal Graphs (Q5458556) (← links)
- On 2-Subcolourings of Chordal Graphs (Q5458558) (← links)
