( en | de | ru )

 

Disambiguation of "Stacho, Juraj"

Author of the publication

copydeleteadd this publication to your clipboard
Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number.

, and . J. Graph Theory, 78 (1): 61-79 (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Juraj Kukolja

Juraj Kukolja

Juraj Böhm

Juraj Koza

Juraj Mészáro

 

Other publications of authors with the same name

Contact Representations of Planar Graphs: Extending a Partial Representation is Hard, , , , and . Graph-Theoretic Concepts in Computer Science - 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers, volume 8747 of Lecture Notes in Computer Science, page 139--151. Springer, (2014)Polarity of chordal graphs., , , and . Discret. Appl. Math., 156 (13): 2469-2479 (2008)The vertex leafage of chordal graphs, and . CoRR, (2011)Max point-tolerance graphs, , , , , , and . Discrete Applied Mathematics, (2017)Unique Perfect Phylogeny Is NP-Hard., and . CPM, volume 6661 of Lecture Notes in Computer Science, page 132-146. Springer, (2011)Vertex Ordering Characterizations of Graphs of Bounded Asteroidal Number., and . J. Graph Theory, 78 (1): 61-79 (2015)Polynomial-Time Algorithm for the Leafage of Chordal Graphs., and . ESA, volume 5757 of Lecture Notes in Computer Science, page 290-300. Springer, (2009)3-Colouring AT-Free Graphs in Polynomial Time.. ISAAC (2), volume 6507 of Lecture Notes in Computer Science, page 144-155. Springer, (2010)Algorithmic complexity of finding cross-cycles in flag complexes., and . SCG, page 51-60. ACM, (2012)Constraint Satisfaction with Counting Quantifiers 2., and . CoRR, (2013)