Premium
Generating 5‐regular planar graphs
Author(s) -
Ding Guoli,
Kanno Jinko,
Su Jianning
Publication year - 2009
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.20377
Subject(s) - combinatorics , mathematics , planar graph , 1 planar graph , pathwidth , outerplanar graph , planar , discrete mathematics , graph , class (philosophy) , chordal graph , enhanced data rates for gsm evolution , line graph , computer science , telecommunications , artificial intelligence , computer graphics (images)
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom