The existence of a 2-factor in K<sub>1, n</sub>-free graphs with large connectivity and large edge-connectivity.
- Published in:
- Journal of Graph Theory, 2011, v. 68, n. 1, p. 77, doi. 10.1002/jgt.20541
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2011 AND VI 68 AND IP 1
Results: 6
1
2
On bipartite 2-factorizations of k<sub> n</sub> − I and the Oberwolfach problem.
- Published in:
- Journal of Graph Theory, 2011, v. 68, n. 1, p. 22, doi. 10.1002/jgt.20538
- By:
- Publication type:
- Article
3
Circumferences of k-connected graphs involving independence numbers.
- Published in:
- Journal of Graph Theory, 2011, v. 68, n. 1, p. 55, doi. 10.1002/jgt.20540
- By:
- Publication type:
- Article
4
On a theorem of Goldberg.
- Published in:
- Journal of Graph Theory, 2011, v. 68, n. 1, p. 8, doi. 10.1002/jgt.20537
- By:
- Publication type:
- Article
5
Maximum packings of the complete graph with uniform length cycles.
- Published in:
- Journal of Graph Theory, 2011, v. 68, n. 1, p. 1, doi. 10.1002/jgt.20536
- By:
- Publication type:
- Article
6
On partitioning interval graphs into proper interval subgraphs and related problems.
- Published in:
- Journal of Graph Theory, 2011, v. 68, n. 1, p. 38, doi. 10.1002/jgt.20539
- By:
- Publication type:
- Article