Found: 6
Select item for more details and to access through your institution.
Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs.
- Published in:
- Computer Journal, 2016, v. 59, n. 5, p. 650, doi. 10.1093/comjnl/bxv096
- By:
- Publication type:
- Article
Clique‐width: Harnessing the power of atoms.
- Published in:
- Journal of Graph Theory, 2023, v. 104, n. 4, p. 769, doi. 10.1002/jgt.23000
- By:
- Publication type:
- Article
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration.
- Published in:
- Journal of Graph Theory, 2021, v. 98, n. 1, p. 81, doi. 10.1002/jgt.22683
- By:
- Publication type:
- Article
Filling the complexity gaps for colouring planar and bounded degree graphs.
- Published in:
- Journal of Graph Theory, 2019, v. 92, n. 4, p. 377, doi. 10.1002/jgt.22459
- By:
- Publication type:
- Article
Hereditary graph classes: When the complexities of coloring and clique cover coincide.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 3, p. 267, doi. 10.1002/jgt.22431
- By:
- Publication type:
- Article
Bounding the Clique-Width of H-Free Chordal Graphs.
- Published in:
- Journal of Graph Theory, 2017, v. 86, n. 1, p. 42, doi. 10.1002/jgt.22111
- By:
- Publication type:
- Article