• Home
  • Search
  • Browse Collections
  • My Account
  • About
  • DC Network Digital Commons Network™
Skip to main content
  • Home
  • About
  • About
  • My Account
University of Memphis Digital Commons University of Memphis

Home > Colleges & Schools > CAS > Mathematical Sciences > SPECCOLL-FAUDREERJ

Ralph J. Faudree

Ralph J. Faudree

 

Publications of Dr. Ralph J. Faudree (1939-2015). A world-class research mathematician in the area of graph theory, Dr. Faudree joined Memphis State University in 1971. He served as Chair of the Department of Mathematical Sciences (1983-1994), Dean of the College of Arts and Sciences (1995-2000), University Provost (2001-2012), and Interim-President (2000-2001).

Printing is not supported at the primary Gallery Thumbnail page. Please first navigate to a specific Image before printing.

Follow

Switch View to Grid View Slideshow
 
  • Generalized Ramsey Theory for Multiple Colors

    Generalized Ramsey Theory for Multiple Colors

  • Generalizing Pancyclic and k-Ordered Graphs

    Generalizing Pancyclic and k-Ordered Graphs

  • Goodness of Trees for Generalized Books

    Goodness of Trees for Generalized Books

  • Graph Spectra

    Graph Spectra

  • Graphs which have an Ascending Subgraph Decomposition

    Graphs which have an Ascending Subgraph Decomposition

  • Graphs with an Ascending Subgraph Decomposition

    Graphs with an Ascending Subgraph Decomposition

  • Graphs with Certain Families of Spanning Trees

    Graphs with Certain Families of Spanning Trees

  • Graph Theory

    Graph Theory

  • Graph Theory

    Graph Theory

  • Groups in Which Each Element Commutes with its Endomorphic Images

    Groups in Which Each Element Commutes with its Endomorphic Images

  • Hamiltonian Cycles Containing Ordered Linear Forests

    Hamiltonian Cycles Containing Ordered Linear Forests

  • Hamiltonian Properties and Adjacency Conditions in K(1,3)-Free Graphs

    Hamiltonian Properties and Adjacency Conditions in K(1,3)-Free Graphs

  • Hamiltonicity in Balanced k-Partite Graphs

    Hamiltonicity in Balanced k-Partite Graphs

  • How to Make a Graph Bipartite

    How to Make a Graph Bipartite

  • Independence, Domination, Irredundance, and Forbidden Pairs

    Independence, Domination, Irredundance, and Forbidden Pairs

  • Induced Matchings in Bipartite Graphs

    Induced Matchings in Bipartite Graphs

  • Intersections of Longest Cycles in k-Connected Graphs

    Intersections of Longest Cycles in k-Connected Graphs

  • Irregularity Strength of Dense Graphs

    Irregularity Strength of Dense Graphs

  • Irregular Networks, Regular Graphs and Integer Matrices with Distinct Row and Column Sums

    Irregular Networks, Regular Graphs and Integer Matrices with Distinct Row and Column Sums

  • Linear Forests and Ordered Cycles

    Linear Forests and Ordered Cycles

  • Local Connectivity and Cycle Extension in Claw-Free Graphs

    Local Connectivity and Cycle Extension in Claw-Free Graphs

  • Locally Finite and Solvable Subgroups of SFields

    Locally Finite and Solvable Subgroups of SFields

  • Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs

    Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs

  • Locating Pairs of Vertices on Hamiltonian Cycles

    Locating Pairs of Vertices on Hamiltonian Cycles

  • Locating Sets of Vertices on Hamiltonian Cycles

    Locating Sets of Vertices on Hamiltonian Cycles

 

Page 4 of 10

  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
 
 

Search

Advanced Search

  • Notify me via email or RSS

Browse

  • Collections
  • Disciplines
  • Authors
  • Exhibits

Author Corner

  • Author FAQ

Libraries

  • McWherter Library
  • Music Library
  • Health Sciences Library
  • Lambuth Library
  • Instagram
  • Facebook
  • Twitter
  • YouTube
  • Blog
 
Elsevier - Digital Commons

Home | About | FAQ | My Account | Accessibility Statement

Privacy Copyright