On the Kőnig‐Egerváry theorem for k‐paths.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 1, p. 73, doi. 10.1002/jgt.22421
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2019 AND VI 91 AND IP 1
Results: 7
1
2
Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 1, p. 5, doi. 10.1002/jgt.22417
- By:
- Publication type:
- Article
3
Improper coloring of graphs on surfaces.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 1, p. 16, doi. 10.1002/jgt.22418
- By:
- Publication type:
- Article
4
Issue Information.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 1, p. 1, doi. 10.1002/jgt.22379
- Publication type:
- Article
5
An improvement on the maximum number of k‐dominating independent sets.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 1, p. 88, doi. 10.1002/jgt.22422
- By:
- Publication type:
- Article
6
Fractal graphs.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 1, p. 53, doi. 10.1002/jgt.22420
- By:
- Publication type:
- Article
7
The evasiveness conjecture and graphs on 2p vertices.
- Published in:
- Journal of Graph Theory, 2019, v. 91, n. 1, p. 35, doi. 10.1002/jgt.22419
- By:
- Publication type:
- Article