Long cycles in critical graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 3, p. 193, doi. 10.1002/1097-0118(200011)35:3<193::AID-JGT4>3.0.CO;2-G
- By:
- Publication type:
- Article
Works matching IS 03649024 AND DT 2000 AND VI 35 AND IP 3
Results: 7
1
2
On graphs with linear Ramsey numbers.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 3, p. 176, doi. 10.1002/1097-0118(200011)35:3<176::AID-JGT3>3.0.CO;2-C
- By:
- Publication type:
- Article
3
A lower bound for the crossing number of C<sub>m</sub> × C<sub>n</sub>.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 3, p. 222, doi. 10.1002/1097-0118(200011)35:3<222::AID-JGT7>3.0.CO;2-E
- By:
- Publication type:
- Article
4
Another note on cliques and independent sets.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 3, p. 173, doi. 10.1002/1097-0118(200011)35:3<173::AID-JGT2>3.0.CO;2-O
- By:
- Publication type:
- Article
5
Crossing properties of graph reliability functions.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 3, p. 206, doi. 10.1002/1097-0118(200011)35:3<206::AID-JGT6>3.0.CO;2-7
- By:
- Publication type:
- Article
6
Decreasing the diameter of bounded degree graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 3, p. 161, doi. 10.1002/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-Y
- By:
- Publication type:
- Article
7
Coloring edges of embedded graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 3, p. 197, doi. 10.1002/1097-0118(200011)35:3<197::AID-JGT5>3.0.CO;2-1
- By:
- Publication type:
- Article