Arthur M. Hobbs

Follow

Generating author description...

All published works
Action Title Year Authors
+ Balanced and 1-balanced graph constructions 2010 Arthur M. Hobbs
Lavanya Kannan
Hong‐Jian Lai
Hongyuan Lai
Guoqing Weng
+ Hamiltonicity in vertex envelopes of plane cubic graphs 2008 Herbert Fleischner
Arthur M. Hobbs
Michael T. Muzheve
+ Transforming a graph into a 1-balanced graph 2008 Lavanya Kannan
Arthur M. Hobbs
Hong‐Jian Lai
Hongyuan Lai
+ PDF Chat Mathematical Expeditions: Chronicles by the Explorers 2002 Arthur M. Hobbs
Reinhard Laubenbacher
David Pengelley
+ Reviews 2002 Gerald B. Folland
Arthur M. Hobbs
Robert G. Bartle
+ Graph family operations 2001 Arthur M. Hobbs
Hong‐Jian Lai
Paul A. Catlin
+ Fractional arboricity, strength, and principal partitions in graphs and matroids 1992 Paul A. Catlin
Jerrold W. Grossman
Arthur M. Hobbs
Hong‐Jian Lai
+ Packing trees in complete graphs 1987 Arthur M. Hobbs
Brian A Bourgeois
Jothi Kasiraj
+ On the maximum number of independent edges in cubic graphs 1982 Arthur M. Hobbs
E. F. Schmeichel
+ Disjoint cliques and disjoint maximal independent sets of vertices in graphs 1982 Paul Erdős
Arthur M. Hobbs
Charles Payan
+ Maximal Hamiltonian cycles in squares of graphs 1979 Arthur M. Hobbs
+ A class of Hamiltonian regular graphs 1978 P. Erdős
Arthur M. Hobbs
+ Hamiltonian Cycles in Regular Graphs 1978 Béla Bollobás
Arthur M. Hobbs
+ Hamiltonian cycles in regular graphs of moderate degree 1977 P. Erdős
Arthur M. Hobbs
+ The entire graph of a bridgeless connected plane graph is hamiltonian 1976 Arthur M. Hobbs
John Mitchem
+ PDF Chat Hamiltonian Cycles in Squares of Vertex-Unicyclic Graphs 1976 Herbert Fleischner
Arthur M. Hobbs
+ The square of a block is vertex pancyclic 1976 Arthur M. Hobbs
+ A necessary condition for the square of a graph to be Hamiltonian 1975 Herbert Fleischner
Arthur M. Hobbs
+ Hamiltonian Total Graphs 1975 Herbert Fleischner
Arthur M. Hobbs
+ The square of a block is Hamiltonian connected 1974 Gary Chartrand
Arthur M. Hobbs
H. A. Jung
Sanjiv Kapoor
C. St. J. A. Nash‐Williams
+ Some Hamiltonian results in powers of graphs 1973 Arthur M. Hobbs
+ Thickness and connectivity in graphs 1968 Arthur M. Hobbs
Jerrold W. Grossman
Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ The square of every two-connected graph is Hamiltonian 1974 Herbert Fleischner
6
+ The square of a block is Hamiltonian connected 1974 Gary Chartrand
Arthur M. Hobbs
H. A. Jung
Sanjiv Kapoor
C. St. J. A. Nash‐Williams
3
+ PDF Chat On a certain ordering of the vertices of a tree 1964 František Neuman
3
+ Fractional arboricity, strength, and principal partitions in graphs and matroids 1992 Paul A. Catlin
Jerrold W. Grossman
Arthur M. Hobbs
Hong‐Jian Lai
3
+ Optimal attack and reinforcement of a network 1985 William H. Cunningham
3
+ Strongly balanced graphs and random graphs 1986 Andrzej Ruciński
Andrew Vince
3
+ Connectivity in Graphs 1966 W. T. Tutte
2
+ A method in graph theory 1976 J. A. Bondy
Vašek Chvátal
2
+ On Hamilton's ideals 1972 Vašek Chvátal
2
+ n-Hamiltonian graphs 1970 Gary Chartrand
Sanjiv Kapoor
Don R. Lick
2
+ PDF Chat Trees with Hamiltonian square 1971 Frank Harary
Allen J. Schwenk
2
+ Convex hulls of dense balanced graphs 1992 Tomasz Łuczak
Andrzej Ruciński
2
+ Hamiltonian Total Graphs 1975 Herbert Fleischner
Arthur M. Hobbs
2
+ On the Problem of Decomposing a Graph into <i>n</i> Connected Factors 1961 W. T. Tutte
2
+ A necessary condition for the square of a graph to be Hamiltonian 1975 Herbert Fleischner
Arthur M. Hobbs
2
+ A note on Hamiltonian circuits 1972 Vašek Chvátal
P. Erdős
2
+ The square of a block is vertex pancyclic 1976 Arthur M. Hobbs
2
+ A class of Hamiltonian regular graphs 1978 P. Erdős
Arthur M. Hobbs
2
+ Hamiltonian-connected graphs 2008 Kewen Zhao
Hong‐Jian Lai
Ju Zhou
2
+ Coverings by minimal transversals 1978 Charles Payan
1
+ Maximally Distant Trees and Principal Partition of a Linear Graph 1969 Genya Kishi
Yoji Kajitani
1
+ Supereulerian graphs: A survey 1992 Paul A. Catlin
1
+ Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow properties 1992 François Jaeger
Nathan Linial
Charles Payan
Michael Tarsi
1
+ Hamiltonian decompositions of complete regular s-partite graphs 1986 A. J. W. Hilton
C. A. Rodger
1
+ Mathematics in Society and History 1992 Sal Restivo
1
+ The entire graph of a bridgeless connected plane graph is hamiltonian 1976 Arthur M. Hobbs
John Mitchem
1
+ On Hamiltonian bipartite graphs 1963 J. W. Moon
Leo Moser
1
+ Cyclic Orderings of Matroids 2007 Stéphan Thomassé
1
+ The unreasonable effectiveness of mathematics in the natural sciences. Richard courant lecture in mathematical sciences delivered at New York University, May 11, 1959 1960 E. P. Wigner
1
+ Edge-Disjoint Spanning Trees of Finite Graphs 1961 C. St. J. A. Nash‐Williams
1
+ Proofs and Refutations 1976 1
+ Women of Mathematics: A Biobibliographic Sourcebook 1989 Barry Schiller
Helen E. Salzberg
Louise S. Grinstein
Paul J. Campbell
1
+ Graduate Texts in Mathematics 1977 Rajendra Bhatia
Glen Bredon
Wolfgang Walter
Joseph Rotman
M. Ram Murty
Jane Gilman
Peter Walters
Martin Golubitsky
Ioannis Karatzas
Henri Cohen
1
+ Hamiltonian and Eulerian properties of entire graphs 1972 John Mitchem
1
+ A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph 1990 W. C. Stephen Suen
1
+ The principal minors of a matroid 1971 John Bruno
Louis Weinberg
1
+ On the number of strictly balanced subgraphs of a random graph 1983 Michał Karoński
Andrezj Ruciński
1
+ On Sperner families satisfying an additional condition 1976 Péter Frankl
1
+ Return to the Riemann Integral 1996 Robert G. Bartle
1
+ Handbook of Analysis and Its Foundations 1997 Eric Schechter
1
+ PDF Chat Cubic identity graphs and planar graphs derived from trees 1970 A. T. Balaban
Roy O. Davies
Frank Harary
Anthony Hill
R. Westwick
1
+ Alternating hamiltonian cycles in two colored complete bipartite graphs 1992 Amanda G. Chetwynd
A. J. W. Hilton
1
+ Balanced graphs and network flows 1997 Stephen G. Penrice
1
+ The Unreasonable Effectiveness of Mathematics 1980 R. W. Hamming
1
+ On random graphs. I. 2022 P. Erdős
A. Rényi
1
+ Every graph is contained in a sparsest possible balanced graph 1985 Ervin Győri
Bruce Rothschild
A. Runciński
1
+ Hamiltonian cycles in regular graphs of moderate degree 1977 P. Erdős
Arthur M. Hobbs
1
+ Balanced Extensions of Spare Graphs 1992 Tomasz Łuczak
Andrzej Ruciński
1
+ Some Hamiltonian results in powers of graphs 1973 Arthur M. Hobbs
1
+ PDF Chat A Contribution to the Theory of Chromatic Polynomials 1954 W. T. Tutte
1