Found: 5
Select item for more details and to access through your institution.
Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement.
- Published in:
- Theory of Computing Systems, 2017, v. 60, n. 4, p. 581, doi. 10.1007/s00224-016-9686-0
- By:
- Publication type:
- Article
Using contracted solution graphs for solving reconfiguration problems.
- Published in:
- Acta Informatica, 2019, v. 56, n. 7/8, p. 619, doi. 10.1007/s00236-019-00336-8
- By:
- Publication type:
- Article
Independent Set Reconfiguration in Cographs and their Generalizations.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 2, p. 164, doi. 10.1002/jgt.21992
- By:
- Publication type:
- Article
Extremal graphs having no matching cuts.
- Published in:
- Journal of Graph Theory, 2012, v. 69, n. 2, p. 206, doi. 10.1002/jgt.20576
- By:
- Publication type:
- Article
The complexity of the matching-cut problem for planar graphs and other graph classes.
- Published in:
- Journal of Graph Theory, 2009, v. 62, n. 2, p. 109, doi. 10.1002/jgt.20390
- By:
- Publication type:
- Article