Found: 7
Select item for more details and to access through your institution.
On k-ordered graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 69, doi. 10.1002/1097-0118(200010)35:2<69::AID-JGT1>3.0.CO;2-I
- By:
- Publication type:
- Article
The edge-bandwidth of theta graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 89, doi. 10.1002/1097-0118(200010)35:2<89::AID-JGT3>3.0.CO;2-A
- By:
- Publication type:
- Article
Constructing cubic edge- but not vertex-transitive graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 152, doi. 10.1002/1097-0118(200010)35:2<152::AID-JGT7>3.0.CO;2-I
- By:
- Publication type:
- Article
Hall's theorem for hypergraphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 83, doi. 10.1002/1097-0118(200010)35:2<83::AID-JGT2>3.0.CO;2-V
- By:
- Publication type:
- Article
Miscellaneous problems on infinite graphs.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 128, doi. 10.1002/1097-0118(200010)35:2<128::AID-JGT6>3.0.CO;2-6
- By:
- Publication type:
- Article
The Ramsey number for a cycle of length five vs. a complete graph of order six.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 99, doi. 10.1002/1097-0118(200010)35:2<99::AID-JGT4>3.0.CO;2-6
- By:
- Publication type:
- Article
On decomposing a graph into nontrivial bonds.
- Published in:
- Journal of Graph Theory, 2000, v. 35, n. 2, p. 109, doi. 10.1002/1097-0118(200010)35:2<109::AID-JGT5>3.0.CO;2-8
- By:
- Publication type:
- Article