Group connectivity under 3‐edge‐connectivity.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 3, p. 438, doi. 10.1002/jgt.22623
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2021 AND VI 96 AND IP 3
Results: 7
1
2
Clique‐convergence is undecidable for automatic graphs.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 3, p. 414, doi. 10.1002/jgt.22622
- By:
- Publication type:
- Article
3
On the mean subtree order of graphs under edge addition.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 3, p. 403, doi. 10.1002/jgt.22621
- By:
- Publication type:
- Article
4
Toughness and spanning trees in K4‐minor‐free graphs.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 3, p. 379, doi. 10.1002/jgt.22620
- By:
- Publication type:
- Article
5
Graphs of bounded depth‐2 rank‐brittleness.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 3, p. 361, doi. 10.1002/jgt.22619
- By:
- Publication type:
- Article
6
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 3, p. 343, doi. 10.1002/jgt.22617
- By:
- Publication type:
- Article
7
Issue Information.
- Published in:
- Journal of Graph Theory, 2021, v. 96, n. 3, p. 339, doi. 10.1002/jgt.22582
- Publication type:
- Article