George R. T. Hendry

From MaRDI portal
Person:750460

Available identifiers

zbMath Open hendry.george-r-tMaRDI QIDQ750460

List of research outcomes





PublicationDate of PublicationType
Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex2000-11-02Paper
An extremal problem for cycles in hamiltonian graphs1995-11-29Paper
The ramsey number r(k1 + c4, k5e)1995-02-01Paper
SMALL RAMSEY NUMBERS II: CRITICAL COLOURINGS FORr(C5+ e,K5)1994-09-22Paper
https://portal.mardi4nfdi.de/entity/Q40170451993-01-16Paper
On Ore-type sufficient condition for a bipancyclic ordering1992-09-27Paper
Extending cycles in bipartite graphs1991-01-01Paper
Extending cycles in graphs1990-01-01Paper
Path extendable graphs1990-01-01Paper
Research problems1990-01-01Paper
A strengthening of Kikustapos;s theorem1989-01-01Paper
Ramsey numbers for graphs with five vertices1989-01-01Paper
On mean distance in certain classes of graphs1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q31978561989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30322811989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30337921989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42067711989-01-01Paper
Scattering number and extremal non-Hamiltonian graphs1988-01-01Paper
The multiplicity of 1-factors in total graphs1988-01-01Paper
On minimum degree in Hamiltonian path graphs1988-01-01Paper
On the hamiltonian path graph of a graph1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37755851987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37206341986-01-01Paper
The size of graphs uniquely Hamiltonian-connected from a vertex1986-01-01Paper
Existence of graphs with prescribed mean distance1986-01-01Paper
The square of a connected S(K1,3)-free graph is vertex pancyclic1985-01-01Paper
On graphs with prescribed median I1985-01-01Paper
On graphs with prescribed median I1985-01-01Paper
Maximum graphs with a unique k-factor1984-01-01Paper
The multiplicity of 1-factors in the square of a graph1984-01-01Paper
Graphs uniquely Hamiltonian-connected from a vertex1984-01-01Paper
Maximum non-path-connected graphs1984-01-01Paper
Maximum graphs non-Hamiltonian-connected from a vertex1984-01-01Paper

Research outcomes over time

This page was built for person: George R. T. Hendry