Title
Generating 5-regular planar graphs
Abstract
For k=0, 1, 2, 3, 4, 5, let ${\cal{P}}_{k}$ be the class of k -edge-connected 5-regular planar graphs. In this paper, graph operations are introduced that generate all graphs in each ${\cal{P}}_{k}$. © 2009 Wiley Periodicals, Inc. J Graph Theory 61: 219–240, 2009
Year
DOI
Venue
2009
10.1002/jgt.v61:3
Journal of Graph Theory
Keywords
Field
DocType
planar graph,planar graphs
Topology,Random regular graph,Discrete mathematics,Strongly regular graph,Combinatorics,Chordal graph,Polyhedral graph,Book embedding,Universal graph,1-planar graph,Mathematics,Pancyclic graph
Journal
Volume
Issue
ISSN
61
3
0364-9024
Citations 
PageRank 
References 
1
0.38
8
Authors
3
Name
Order
Citations
PageRank
Guoli Ding144451.58
Jinko Kanno2236.03
Jianning Su341.53