Clique‐cutsets beyond chordal graphs.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 2, p. 192, doi. 10.1002/jgt.22428
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2019 AND VI 91 AND IP 2
Results: 7
1
2
On dihedral flows in embedded graphs.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 2, p. 174, doi. 10.1002/jgt.22427
- By:
- Publication type:
- Article
3
On distance r‐dominating and 2r‐independent sets in sparse graphs.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 2, p. 162, doi. 10.1002/jgt.22426
- By:
- Publication type:
- Article
4
Issue Information.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 2, p. 99, doi. 10.1002/jgt.22380
- Publication type:
- Article
5
A note on a Brooks' type theorem for DP‐coloring.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 2, p. 148, doi. 10.1002/jgt.22425
- By:
- Publication type:
- Article
6
Partitioning two‐coloured complete multipartite graphs into monochromatic paths and cycles.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 2, p. 122, doi. 10.1002/jgt.22424
- By:
- Publication type:
- Article
7
The average degree of a subcubic edge‐chromatic critical graph.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 2, p. 103, doi. 10.1002/jgt.22423
- By:
- Publication type:
- Article