George R. T. Hendry

Available identifiers

zbMath Open hendry.george-r-tMaRDI QIDQ750460

List of research outcomes

Publication	Date of Publication	Type
Forbidden subgraphs of graphs uniquely Hamiltonian-connected from a vertex	2000-11-02	Paper
An extremal problem for cycles in hamiltonian graphs	1995-11-29	Paper
The ramsey number r(k₁ + c₄, k₅ − e)	1995-02-01	Paper
SMALL RAMSEY NUMBERS II: CRITICAL COLOURINGS FORr(C₅+ e,K₅)	1994-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q4017045	1993-01-16	Paper
On Ore-type sufficient condition for a bipancyclic ordering	1992-09-27	Paper
Extending cycles in bipartite graphs	1991-01-01	Paper
Extending cycles in graphs	1990-01-01	Paper
Path extendable graphs	1990-01-01	Paper
Research problems	1990-01-01	Paper
A strengthening of Kikustapos;s theorem	1989-01-01	Paper
Ramsey numbers for graphs with five vertices	1989-01-01	Paper
On mean distance in certain classes of graphs	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3197856	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3032281	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3033792	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4206771	1989-01-01	Paper
Scattering number and extremal non-Hamiltonian graphs	1988-01-01	Paper
The multiplicity of 1-factors in total graphs	1988-01-01	Paper
On minimum degree in Hamiltonian path graphs	1988-01-01	Paper
On the hamiltonian path graph of a graph	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3775585	1987-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3720634	1986-01-01	Paper
The size of graphs uniquely Hamiltonian-connected from a vertex	1986-01-01	Paper
Existence of graphs with prescribed mean distance	1986-01-01	Paper
The square of a connected S(K1,3)-free graph is vertex pancyclic	1985-01-01	Paper
On graphs with prescribed median I	1985-01-01	Paper
On graphs with prescribed median I	1985-01-01	Paper
Maximum graphs with a unique k-factor	1984-01-01	Paper
The multiplicity of 1-factors in the square of a graph	1984-01-01	Paper
Graphs uniquely Hamiltonian-connected from a vertex	1984-01-01	Paper
Maximum non-path-connected graphs	1984-01-01	Paper
Maximum graphs non-Hamiltonian-connected from a vertex	1984-01-01	Paper

Research outcomes over time

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