Works matching IS 03649024 AND DT 1999 AND VI 32 AND IP 4

Results: 8
    1

    Coloring of trees with minimum sum of colors.

    Published in:
    Journal of Graph Theory, 1999, v. 32, n. 4, p. 354, doi. 10.1002/(SICI)1097-0118(199912)32:4<354::AID-JGT4>3.0.CO;2-B
    By:
    • Jiang, Tao;
    • West, Douglas B.
    Publication type:
    Article
    2
    3
    4

    On critically perfect graphs.

    Published in:
    Journal of Graph Theory, 1999, v. 32, n. 4, p. 394, doi. 10.1002/(SICI)1097-0118(199912)32:4<394::AID-JGT7>3.0.CO;2-Z
    By:
    • Wagler, Annegret
    Publication type:
    Article
    5

    Dirac's map-color theorem for choosability.

    Published in:
    Journal of Graph Theory, 1999, v. 32, n. 4, p. 327, doi. 10.1002/(SICI)1097-0118(199912)32:4<327::AID-JGT2>3.0.CO;2-B
    By:
    • Böhme, T.;
    • Mohar, B.;
    • Stiebitz, M.
    Publication type:
    Article
    6

    A lower bound for partial list colorings.

    Published in:
    Journal of Graph Theory, 1999, v. 32, n. 4, p. 390, doi. 10.1002/(SICI)1097-0118(199912)32:4<390::AID-JGT6>3.0.CO;2-D
    By:
    • Chappell, Glenn G.
    Publication type:
    Article
    7
    8

    Perfectly contractile diamond-free graphs.

    Published in:
    Journal of Graph Theory, 1999, v. 32, n. 4, p. 359, doi. 10.1002/(SICI)1097-0118(199912)32:4<359::AID-JGT5>3.0.CO;2-U
    By:
    • Rusu, Irena
    Publication type:
    Article