A degree sum condition for longest cycles in 3‐connected graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 4, p. 277
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2007 AND VI 54 AND IP 4
Results: 7
1
2
Forcing highly connected subgraphs.
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 4, p. 331
- By:
- Publication type:
- Article
3
Simultaneous diagonal flips in plane triangulationsA preliminary version of this paper was published in the Proceedings of the 17th Annual ACM‐SIAM Symposium on Discrete Algorithms (SODA'06).
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 4, p. 307
- By:
- Publication type:
- Article
4
Perfect coloring and linearly χ‐bound P6‐free graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 4, p. 293
- By:
- Publication type:
- Article
5
Nowhere‐zero flows in tensor product of graphs.
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 4, p. 284
- By:
- Publication type:
- Article
6
Erratum to: “A linear vizing‐like relation relating the size and total domination number of a graph”.
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 4, p. 350
- By:
- Publication type:
- Article
7
A bound on the chromatic number using the longest odd cycle length.
- Published in:
- Journal of Graph Theory, 2007, v. 54, n. 4, p. 267
- By:
- Publication type:
- Article