Found: 7
Select item for more details and to access through your institution.
Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 303, doi. 10.1002/jgt.22001
- By:
- Publication type:
- Article
Issue Information.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 209, doi. 10.1002/jgt.21986
- Publication type:
- Article
Maximal Induced Matchings in Triangle-Free Graphs.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 231, doi. 10.1002/jgt.21994
- By:
- Publication type:
- Article
Rainbow Arborescence in Random Digraphs.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 251, doi. 10.1002/jgt.21995
- By:
- Publication type:
- Article
On the Number of 4-Cycles in a Tournament.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 266, doi. 10.1002/jgt.21996
- By:
- Publication type:
- Article
Finding.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 277, doi. 10.1002/jgt.21997
- By:
- Publication type:
- Article
Extremal C<sub>4</sub>-Free/ C<sub>5</sub>-Free Planar Graphs.
- Published in:
- Journal of Graph Theory, 2016, v. 83, n. 3, p. 213, doi. 10.1002/jgt.21991
- By:
- Publication type:
- Article