Nonseparating K<sub>4</sub>‐subdivisions in graphs of minimum degree at least 4.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 194, doi. 10.1002/jgt.22247
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2018 AND VI 89 AND IP 2
Results: 8
1
2
On minimum bisection and related cut problems in trees and tree‐like graphs.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 214, doi. 10.1002/jgt.22248
- By:
- Publication type:
- Article
3
Issue Information.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 89, doi. 10.1002/jgt.22199
- Publication type:
- Article
4
Tight lower bounds on the matching number in a graph with given maximum degree.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 115, doi. 10.1002/jgt.22244
- By:
- Publication type:
- Article
5
A constructive characterisation of circuits in the simple (2,1)‐sparse matroid.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 150, doi. 10.1002/jgt.22245
- By:
- Publication type:
- Article
6
More on foxes.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 101, doi. 10.1002/jgt.22243
- By:
- Publication type:
- Article
7
On homeomorphically irreducible spanning trees in cubic graphs.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 93, doi. 10.1002/jgt.22242
- By:
- Publication type:
- Article
8
Extensions of a theorem of Erdős on nonhamiltonian graphs.
- Published in:
- Journal of Graph Theory, 2018, v. 89, n. 2, p. 176, doi. 10.1002/jgt.22246
- By:
- Publication type:
- Article