R. L. Hemminger

From MaRDI portal
Person:1050354

Available identifiers

zbMath Open hemminger.robert-lWikidataQ83426674 ScholiaQ83426674MaRDI QIDQ1050354

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q43550701998-03-08Paper
https://portal.mardi4nfdi.de/entity/Q43496101997-12-17Paper
https://portal.mardi4nfdi.de/entity/Q48767391996-10-06Paper
https://portal.mardi4nfdi.de/entity/Q48635091996-02-06Paper
https://portal.mardi4nfdi.de/entity/Q48427091995-08-16Paper
https://portal.mardi4nfdi.de/entity/Q43045781995-03-12Paper
Contractible edges in longest cycles in non-Hamiltonian graphs1994-11-03Paper
The 3‐connected graphs with a maximum matching containing precisely one contractible edge1994-08-29Paper
https://portal.mardi4nfdi.de/entity/Q31392801993-11-11Paper
The 3‐connected graphs having a longest cycle containing only three contractible edges1993-08-24Paper
Covering contractible edges in 3‐connected graphs. II. Characterizing those with covers of size three1993-08-17Paper
https://portal.mardi4nfdi.de/entity/Q40336841993-05-16Paper
https://portal.mardi4nfdi.de/entity/Q40282621993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40284751993-03-28Paper
On 3-connected graphs with contractible edge covers of size \(k\)1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q30337941990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33489281989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34848781989-01-01Paper
Longest cycles in 3-connected graphs contain three contractible edges1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37817831987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37841011986-01-01Paper
Integer sequences with proscribed differences and bounded growth rate1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37927261985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206171984-01-01Paper
On 3-skein isomorphisms of graphs1982-01-01Paper
On \(n\)-skein isomorphisms of graphs1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36616161982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38955101980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38725081978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42000931978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38552241977-01-01Paper
Graph reconstruction—a survey1977-01-01Paper
Line pseudodigraphs1977-01-01Paper
Infinite digraphs isomorphic with their line digraphs1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40586851975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40812851975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41031311975-01-01Paper
Reconstructing infinite graphs1974-01-01Paper
Reconstructing the n-connected components of a graph1973-01-01Paper
Line isomorphisms on dipseudographs1973-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40712801973-01-01Paper
A family of path properties for graphs1972-01-01Paper
Forbidden subgraphs for graphs with planar line graphs1972-01-01Paper
On Whitney's Line Graph Theorem1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56595721972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56757481972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47759001971-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56281691971-01-01Paper
On Reconstructing a Graph1969-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55812981969-01-01Paper
The group of an X-join of graphs1968-01-01Paper
Errate. The lexicographic product of graphs1967-01-01Paper
Directed Graphs with Transitive Abelian Groups1967-01-01Paper
On the Group of a Directed Graph1966-01-01Paper
On the Wedderburn Principal Theorem for Commutative Power-Associative Algebras1966-01-01Paper
More on the Infinite Primes Theorem1966-01-01Paper
The lexicographic product of graphs1966-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: R. L. Hemminger