Found: 13

Select item for more details and to access through your institution.

  • Diameters of finite upper half plane graphs.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 129, doi. 10.1002/(SICI)1097-0118(199610)23:2<129::AID-JGT4>3.0.CO;2-V
    By:
    • Angel, Jeff;
    • Evans, Ronald
    Publication type:
    Article

  • Hypercube subgraphs with minimal detours.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 119, doi. 10.1002/(SICI)1097-0118(199610)23:2<119::AID-JGT3>3.0.CO;2-W
    By:
    • Erdös, Pál;
    • Hamburger, Peter;
    • Pippert, Raymond E.;
    • Weakley, William D.
    Publication type:
    Article

  • ( p,q)-odd digraphs.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 175, doi. 10.1002/(SICI)1097-0118(199610)23:2<175::AID-JGT8>3.0.CO;2-Q
    By:
    • Galluccio, Anna;
    • Loebl, Martin
    Publication type:
    Article

  • Spanning paths in infinite planar graphs.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 163, doi. 10.1002/(SICI)1097-0118(199610)23:2<163::AID-JGT7>3.0.CO;2-R
    By:
    • Dean, Nathaniel;
    • Thomas, Robin;
    • Yu, Xingxing
    Publication type:
    Article

  • Packing two forests into a bipartite graph.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 209, doi. 10.1002/(SICI)1097-0118(199610)23:2<209::AID-JGT12>3.0.CO;2-B
    By:
    • Wang, Hong
    Publication type:
    Article

  • Solution of a covering problem related to labelled tournaments.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 111, doi. 10.1002/(SICI)1097-0118(199610)23:2<111::AID-JGT2>3.0.CO;2-W
    By:
    • Sgall, Jiří
    Publication type:
    Article

  • On bounded treewidth duality of graphs.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 151, doi. 10.1002/(SICI)1097-0118(199610)23:2<151::AID-JGT6>3.0.CO;2-S
    By:
    • Nešetřil, Jaroslav;
    • Zhu, Xuding
    Publication type:
    Article

  • A generalization of simplicial elimination orderings.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 203, doi. 10.1002/(SICI)1097-0118(199610)23:2<203::AID-JGT11>3.0.CO;2-H
    By:
    • Maffray, Frédéric;
    • Porto, Oscar;
    • Preissmann, Myriam
    Publication type:
    Article

  • Masthead.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. fmi, doi. 10.1002/1097-0118(199610)23:2<::AID-JGT3190230201>3.0.CO;2-L
    Publication type:
    Article

  • Enumeration of connected graph coverings.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 105, doi. 10.1002/(SICI)1097-0118(199610)23:2<105::AID-JGT1>3.0.CO;2-X
    By:
    • Kwak, Jin Ho;
    • Lee, Jaeun
    Publication type:
    Article

  • Fast generation of cubic graphs.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 139, doi. 10.1002/(SICI)1097-0118(199610)23:2<139::AID-JGT5>3.0.CO;2-U
    By:
    • Brinkmann, Gunnar
    Publication type:
    Article

  • The rank and size of graphs.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 185, doi. 10.1002/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.0.CO;2-P
    By:
    • Kotlov, Andrew;
    • Lovász, László
    Publication type:
    Article

  • Every 3-connected, locally connected, claw-free graph is Hamilton-connected.

    Published in:
    Journal of Graph Theory, 1996, v. 23, n. 2, p. 191, doi. 10.1002/(SICI)1097-0118(199610)23:2<191::AID-JGT10>3.0.CO;2-K
    By:
    • Asratian, A. S.
    Publication type:
    Article