Juraj Stacho - Citegraph

Author Info

Name	Affiliation	Papers
JURAJ STACHO	School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6	32
Collaborators	Citations	PageRank
31	93	14.33
Referers	Referees	References
154	400	366

Search Limit

100400

Publications (32 rows)

Collaborators (31 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Minimal Classes Of Graphs Of Unbounded Clique-Width Defined By Finitely Many Forbidden Induced Subgraphs	0	0.34	2021
3-Colorable Subclasses of $P_8$-Free Graphs	0	0.34	2018
4-Coloring P6-Free Graphs with No Induced 5-Cycles.	0	0.34	2017
Bichain graphs: Geometric model and universal graphs.	1	0.35	2016
Complexity of simplicial homology and independence complexes of chordal graphs.	0	0.34	2016
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number	6	0.62	2015
Minimal Classes of Graphs of Unbounded Clique-width and Well-quasi-ordering.	0	0.34	2015
Stable-iΠ partitions of graphs.	0	0.34	2015
Forbidden structure characterization of circular-arc graphs and a certifying recognition algorithm.	2	0.38	2015
Max Point-Tolerance Graphs	1	0.35	2015
Constraint Satisfaction with Counting Quantifiers	1	0.36	2015
Blocking Quadruple: A New Obstruction to Circular-Arc Graphs.	1	0.36	2014
Constraint Satisfaction with Counting Quantifiers 2.	3	0.41	2014
4-coloring $P_6$-free graphs with no induced 5-cycles.	3	0.42	2014
Unique perfect phylogeny is intractable	0	0.34	2013
Obstructions to chordal circular-arc graphs of small independence number	0	0.34	2013
3-Colouring AT-Free Graphs in Polynomial Time	7	0.53	2012
Reduced clique graphs of chordal graphs	12	0.86	2012
On edge-sets of bicliques in graphs	1	0.39	2012
Algorithmic complexity of finding cross-cycles in flag complexes	0	0.34	2012
The vertex leafage of chordal graphs.	2	0.44	2011
Dichotomy for tree-structured trigraph list homomorphism problems	1	0.35	2011
Constraint Satisfaction with Counting Quantifiers.	0	0.34	2011
Unique perfect phylogeny is NP-hard	4	0.44	2011
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid	9	0.61	2011
Polynomial-Time Algorithm for the Leafage of Chordal Graphs	8	0.71	2009
Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage	2	0.43	2009
A Decomposition Theorem for Chordal Graphs and its Applications	2	0.41	2009
On 2-subcolourings of chordal graphs	2	0.42	2008
Polarity of chordal graphs	15	1.11	2008
On injective colourings of chordal graphs	7	0.51	2008
On P4-transversals of chordal graphs	3	0.50	2008