David P. Sumner - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 14 from 14

2007

gamma-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalentTamara Burton, David P. Sumner. DM, 307(6):683-693, 2007. [doi]

2006

Domination dot-critical graphsTamara Burton, David P. Sumner. DM, 306(1):11-18, 2006. [doi]

1994

k-critical graphsOdile Favaron, David P. Sumner, Ewa Wojcicka. jgt, 18(7):723-734, 1994. [doi]

1990

Critical concepts in dominationDavid P. Sumner. DM, 86(1-3):33-46, 1990. [doi]

1985

1, 3-free graphsManton M. Matthews, David P. Sumner. jgt, 9(2):269-277, 1985. [doi]

1984

1, 3-free graphsManton M. Matthews, David P. Sumner. jgt, 8(1):139-146, 1984. [doi]

1983

Domination critical graphsDavid P. Sumner, Pattie Blitch. JCT, 34(1):65-76, 1983. [doi]

1979

Every connected, locally connected nontrivial graph with no induced claw is hamiltonianDavid J. Oberly, Slobodan K. Simic, David P. Sumner. jgt, 3(4):351-356, 1979. [doi]

1978

The edge nucleus of a point-determining graphDennis P. Geoffroy, David P. Sumner. JCT, 24(2):189-201, 1978. [doi]

An upper bound on the size of a largest clique in a graphDennis P. Geoffroy, David P. Sumner. jgt, 2(3):223-230, 1978. [doi]

The connected Ramsey numberDavid P. Sumner. DM, 22(1):49-55, 1978. [doi]

1976

The nucleus of a point determining graphDavid P. Sumner. DM, 14(1):91-97, 1976. [doi]

1973

Point determination in graphsDavid P. Sumner. DM, 5(2):179-187, 1973. [doi]

Graphs indecomposable with respect to the X-joinDavid P. Sumner. DM, 6(3):281-298, 1973. [doi]

Sign in or sign up to see more results.

runs on WebDSL