Skip to search formSkip to main contentSkip to account menu
Topological Graph Theory
Introduction Voltage Graphs and Covering Spaces Surfaces and Graph Imbeddings Imbedded Voltage Graphs and Current Graphs Map Colorings The Genus of A Group References.
View via Publisher
Graph Theory and Its Applications
INTRODUCTION TO GRAPH MODELS Graphs and Digraphs Common Families of Graphs Graph Modeling Applications Walks and Distance Paths, Cycles, and Trees Vertex and Edge Attributes: More Applications…
View via Publisher
Handbook of graph theory
  • J. Gross
  • Mathematics
    Discrete mathematics and its applications
  • 17 April 2007
TLDR
Introduction to Graphs Fundamentals of Graph Theory, Jonathan L. Gross and Jay Yellen Families of Graphs and Digraphs, Lowell W. Wilson Graph Representation Computer Representation of graphs, Alfred V. Aho Graph Isomorphism, Brendan D. McKay The Reconstruction Problem, Josef Lauri Recursively Constructed Graphs, Richard B. Tovey Structural Graph Theory.
View via Publisher
Generating all graph coverings by permutation voltage assignments
View via Publisher
Measuring Culture: A Paradigm for the Analysis of Social Organization
View via Publisher
Handbook of Graph Theory, Second Edition
TLDR
This second edition of Handbook of Graph Theory, Second Edition is over 400 pages longer than its predecessor and incorporates 14 new sections, and is the most comprehensive single-source guide to graph theory.
View via Publisher
Genus distributions for bouquets of circles
View via Publisher
Hierarchy for imbedding-distribution invariants of a graph
TLDR
An entirely different viewpoint is presented in which one seeks distributional information about the huge family of all cellular imbeddings of a graph into all closed surfaces, instead of focusing on just one imbedding or on the existence of imbedDings into just one surface.
View via Publisher
Finding a maximum-genus graph imbedding
TLDR
Topological methods and a reduction to linear matroid parity are used to develop a polynomial-time algorithm to find a maximum-genus cellular imbedding, which seems to be the first im Bedding algorithm for which the running time is not exponential in the genus of the imbeding surface.
View on ACM
Graph Theory and Its Applications, Second Edition (Discrete Mathematics and Its Applications)
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License