4-regular planar graph is unique?A 4-Regular graph with 7 vertices is non planarPlanar graph with a chromatic number of 4 where all vertices have a degree of 4.Proving a graph has no bridgesIs there a $4$-regular planar self-complementary graph with $9$ vertices and $18$ edges?Smallest graph that cannot be represented by the intersection graph of axis-aligned rectanglesFour color theorem, 3-regular planar graph, Hamiltonian path and spiral chainsPlanar Graphs with at least $2$ vertices and degrees at most $5$A problem on a proof in a graph theory textbookCan there exist an uncountable planar graph?3-regular connected planar graphDecide if this cubic graph on 8 vertices is planarPlanar graph and number of faces of certain degreeProve that $K_3,3$ is not planar.Sketch a 5 regular planar graph, G with $chi(G)$ = 3.Obtaining a planar graph from a non-planar graph through vertex addition
Coax or bifilar choke
Word for a person who has no opinion about whether god exists
How to secure an aircraft at a transient parking space?
How to detect if C code (which needs 'extern C') is compiled in C++
Conservation of Mass and Energy
'The literal of type int is out of range' con número enteros pequeños (2 dígitos)
What problems would a superhuman have whose skin is constantly hot?
NASA's RS-25 Engines shut down time
Examples of a statistic that is not independent of sample's distribution?
finite abelian groups tensor product.
What was the Kree's motivation in Captain Marvel?
How does one describe somebody who is bi-racial?
When traveling to Europe from North America, do I need to purchase a different power strip?
What is the magic ball of every day?
Why is computing ridge regression with a Cholesky decomposition much quicker than using SVD?
Hotkey (or other quick way) to insert a keyframe for only one component of a vector-valued property?
Do items de-spawn in Diablo?
Counting all the hearts
Database Backup for data and log files
Can one live in the U.S. and not use a credit card?
Are babies of evil humanoid species inherently evil?
How strictly should I take "Candidates must be local"?
Vocabulary for giving just numbers, not a full answer
Why the color red for the Republican Party
4-regular planar graph is unique?
A 4-Regular graph with 7 vertices is non planarPlanar graph with a chromatic number of 4 where all vertices have a degree of 4.Proving a graph has no bridgesIs there a $4$-regular planar self-complementary graph with $9$ vertices and $18$ edges?Smallest graph that cannot be represented by the intersection graph of axis-aligned rectanglesFour color theorem, 3-regular planar graph, Hamiltonian path and spiral chainsPlanar Graphs with at least $2$ vertices and degrees at most $5$A problem on a proof in a graph theory textbookCan there exist an uncountable planar graph?3-regular connected planar graphDecide if this cubic graph on 8 vertices is planarPlanar graph and number of faces of certain degreeProve that $K_3,3$ is not planar.Sketch a 5 regular planar graph, G with $chi(G)$ = 3.Obtaining a planar graph from a non-planar graph through vertex addition
$begingroup$
I'm working on a project for a class and as part of that project I (previously) decided to do the following problem from our textbook, Combinatorics and Graph Theory 2nd ed. by Harris, Hirst, & Mossinghoff.
Find a 4-regular planar graph, and prove that it is unique.
(Now that I'm posting this I will be using a different problem for my project whether I get help on this or not.) The issue I'm having is that I don't really buy this. "4-regular" means all vertices have degree 4. A "planar" representation of a graph is one where the edges don't intersect (except technically at vertices). Below are two 4-regular planar graphs which do not appear to be the same or even isomorphic. The first one comes from this post and the second one comes from this post.
What's going on? Am I just missing something trivial here?
graph-theory planar-graph
edited Apr 13 '17 at 12:20
Community♦
1
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
$endgroup$
|
show 4 more comments
$begingroup$
I'm working on a project for a class and as part of that project I (previously) decided to do the following problem from our textbook, Combinatorics and Graph Theory 2nd ed. by Harris, Hirst, & Mossinghoff.
Find a 4-regular planar graph, and prove that it is unique.
(Now that I'm posting this I will be using a different problem for my project whether I get help on this or not.) The issue I'm having is that I don't really buy this. "4-regular" means all vertices have degree 4. A "planar" representation of a graph is one where the edges don't intersect (except technically at vertices). Below are two 4-regular planar graphs which do not appear to be the same or even isomorphic. The first one comes from this post and the second one comes from this post.
What's going on? Am I just missing something trivial here?
graph-theory planar-graph
edited Apr 13 '17 at 12:20
Community♦
1
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
$endgroup$
$begingroup$
Yes, I agree. We need something more than just $4$-regular and planar to make the graph unique. You give examples with $8$ vertices and with $12$ vertices. I can think of planar $4$-regular graphs with $10$ and with infinitely many vertices.
$endgroup$
– hardmath
Dec 3 '16 at 4:11
$begingroup$
One thought would be to check the textbook's definition. While you and I take $4$-regular to mean simply each vertex having degree $4$ (four edges at each vertex), it is possible the book defined it to mean something stronger.
$endgroup$
– hardmath
Dec 3 '16 at 4:15
$begingroup$
@hardmath, thanks, that's all the confirmation I need. Re: definition in the book, it just says "A graph $G$ is regular if every vertex has the same degree. $G$ is said to be regular of degree $r$ (or $r$-regular) if $deg(v) = r$ for all vertices $v$ in $G$." I wonder if there's some "we make such-and-such assumption only for this section" that I missed..
$endgroup$
– tilper
Dec 3 '16 at 4:18
$begingroup$
I added an image of the smallest such graph to this recent Question.
$endgroup$
– hardmath
Dec 3 '16 at 4:25
$begingroup$
The only thing I can imagine is that once you fix the order (the number of vertices) of the 4-regular planar graph then it might be unique.
$endgroup$
– Laars Helenius
Dec 3 '16 at 4:40
|
show 4 more comments
$begingroup$
I'm working on a project for a class and as part of that project I (previously) decided to do the following problem from our textbook, Combinatorics and Graph Theory 2nd ed. by Harris, Hirst, & Mossinghoff.
Find a 4-regular planar graph, and prove that it is unique.
(Now that I'm posting this I will be using a different problem for my project whether I get help on this or not.) The issue I'm having is that I don't really buy this. "4-regular" means all vertices have degree 4. A "planar" representation of a graph is one where the edges don't intersect (except technically at vertices). Below are two 4-regular planar graphs which do not appear to be the same or even isomorphic. The first one comes from this post and the second one comes from this post.
What's going on? Am I just missing something trivial here?
graph-theory planar-graph
edited Apr 13 '17 at 12:20
Community♦
1
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
$endgroup$
I'm working on a project for a class and as part of that project I (previously) decided to do the following problem from our textbook, Combinatorics and Graph Theory 2nd ed. by Harris, Hirst, & Mossinghoff.
Find a 4-regular planar graph, and prove that it is unique.
(Now that I'm posting this I will be using a different problem for my project whether I get help on this or not.) The issue I'm having is that I don't really buy this. "4-regular" means all vertices have degree 4. A "planar" representation of a graph is one where the edges don't intersect (except technically at vertices). Below are two 4-regular planar graphs which do not appear to be the same or even isomorphic. The first one comes from this post and the second one comes from this post.
What's going on? Am I just missing something trivial here?
graph-theory planar-graph
graph-theory planar-graph
edited Apr 13 '17 at 12:20
Community♦
1
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
edited Apr 13 '17 at 12:20
Community♦
1
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
edited Apr 13 '17 at 12:20
Community♦
1
edited Apr 13 '17 at 12:20
Community♦
1
edited Apr 13 '17 at 12:20
Community♦
1
1
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
asked Dec 3 '16 at 4:07
tilpertilper
12.9k11145
12.9k11145
$begingroup$
Yes, I agree. We need something more than just $4$-regular and planar to make the graph unique. You give examples with $8$ vertices and with $12$ vertices. I can think of planar $4$-regular graphs with $10$ and with infinitely many vertices.
$endgroup$
– hardmath
Dec 3 '16 at 4:11
$begingroup$
One thought would be to check the textbook's definition. While you and I take $4$-regular to mean simply each vertex having degree $4$ (four edges at each vertex), it is possible the book defined it to mean something stronger.
$endgroup$
– hardmath
Dec 3 '16 at 4:15
$begingroup$
@hardmath, thanks, that's all the confirmation I need. Re: definition in the book, it just says "A graph $G$ is regular if every vertex has the same degree. $G$ is said to be regular of degree $r$ (or $r$-regular) if $deg(v) = r$ for all vertices $v$ in $G$." I wonder if there's some "we make such-and-such assumption only for this section" that I missed..
$endgroup$
– tilper
Dec 3 '16 at 4:18
$begingroup$
I added an image of the smallest such graph to this recent Question.
$endgroup$
– hardmath
Dec 3 '16 at 4:25
$begingroup$
The only thing I can imagine is that once you fix the order (the number of vertices) of the 4-regular planar graph then it might be unique.
$endgroup$
– Laars Helenius
Dec 3 '16 at 4:40
|
show 4 more comments
$begingroup$
Yes, I agree. We need something more than just $4$-regular and planar to make the graph unique. You give examples with $8$ vertices and with $12$ vertices. I can think of planar $4$-regular graphs with $10$ and with infinitely many vertices.
$endgroup$
– hardmath
Dec 3 '16 at 4:11
$begingroup$
One thought would be to check the textbook's definition. While you and I take $4$-regular to mean simply each vertex having degree $4$ (four edges at each vertex), it is possible the book defined it to mean something stronger.
$endgroup$
– hardmath
Dec 3 '16 at 4:15
$begingroup$
@hardmath, thanks, that's all the confirmation I need. Re: definition in the book, it just says "A graph $G$ is regular if every vertex has the same degree. $G$ is said to be regular of degree $r$ (or $r$-regular) if $deg(v) = r$ for all vertices $v$ in $G$." I wonder if there's some "we make such-and-such assumption only for this section" that I missed..
$endgroup$
– tilper
Dec 3 '16 at 4:18
$begingroup$
I added an image of the smallest such graph to this recent Question.
$endgroup$
– hardmath
Dec 3 '16 at 4:25
$begingroup$
The only thing I can imagine is that once you fix the order (the number of vertices) of the 4-regular planar graph then it might be unique.
$endgroup$
– Laars Helenius
Dec 3 '16 at 4:40
$begingroup$
Yes, I agree. We need something more than just $4$-regular and planar to make the graph unique. You give examples with $8$ vertices and with $12$ vertices. I can think of planar $4$-regular graphs with $10$ and with infinitely many vertices.
$endgroup$
– hardmath
Dec 3 '16 at 4:11
$begingroup$
Yes, I agree. We need something more than just $4$-regular and planar to make the graph unique. You give examples with $8$ vertices and with $12$ vertices. I can think of planar $4$-regular graphs with $10$ and with infinitely many vertices.
$endgroup$
– hardmath
Dec 3 '16 at 4:11
$begingroup$
One thought would be to check the textbook's definition. While you and I take $4$-regular to mean simply each vertex having degree $4$ (four edges at each vertex), it is possible the book defined it to mean something stronger.
$endgroup$
– hardmath
Dec 3 '16 at 4:15
$begingroup$
One thought would be to check the textbook's definition. While you and I take $4$-regular to mean simply each vertex having degree $4$ (four edges at each vertex), it is possible the book defined it to mean something stronger.
$endgroup$
– hardmath
Dec 3 '16 at 4:15
$begingroup$
@hardmath, thanks, that's all the confirmation I need. Re: definition in the book, it just says "A graph $G$ is regular if every vertex has the same degree. $G$ is said to be regular of degree $r$ (or $r$-regular) if $deg(v) = r$ for all vertices $v$ in $G$." I wonder if there's some "we make such-and-such assumption only for this section" that I missed..
$endgroup$
– tilper
Dec 3 '16 at 4:18
$begingroup$
@hardmath, thanks, that's all the confirmation I need. Re: definition in the book, it just says "A graph $G$ is regular if every vertex has the same degree. $G$ is said to be regular of degree $r$ (or $r$-regular) if $deg(v) = r$ for all vertices $v$ in $G$." I wonder if there's some "we make such-and-such assumption only for this section" that I missed..
$endgroup$
– tilper
Dec 3 '16 at 4:18
$begingroup$
I added an image of the smallest such graph to this recent Question.
$endgroup$
– hardmath
Dec 3 '16 at 4:25
$begingroup$
I added an image of the smallest such graph to this recent Question.
$endgroup$
– hardmath
Dec 3 '16 at 4:25
$begingroup$
The only thing I can imagine is that once you fix the order (the number of vertices) of the 4-regular planar graph then it might be unique.
$endgroup$
– Laars Helenius
Dec 3 '16 at 4:40
$begingroup$
The only thing I can imagine is that once you fix the order (the number of vertices) of the 4-regular planar graph then it might be unique.
$endgroup$
– Laars Helenius
Dec 3 '16 at 4:40
|
show 4 more comments
1 Answer
1
active
oldest
votes
$begingroup$
Even if we fix the number of vertices, the (connected) $4$-regular planar graph of that order (number of vertices) may not be unique. According to work by Markus Meringer, author of GENREG, the only orders for which there is a unique such graph are likely to be $n=6,8,9$.
An antiprism graph with $2n$ vertices can be given as an example of a vertex-transitive (and therefore regular), polyhedral (and therefore planar) graph.
The pentagonal antiprism looks like this:
There is a different (non-isomorphic) $4$-regular planar graph with ten vertices, namely the elongated square dipyramid:
Non-isomorphism of the graphs can be demonstrated by counting edges of open neighborhoods in the two graphs. The open neighborhood of each vertex of the pentagonal antiprism has three edges forming a simple path. In the elongated square dipyramid some open neighborhoods have two edges that form a path and some have four edges that form a cycle.
Notes about the small odd vertex cases
The only $4$-regular graph on five vertices is $K_5$, which of course is not planar.
Nonexistence of any $4$-regular planar graph on seven vertices was the topic of this previous Question.
Uniqueness of the $4$-regular planar graph on nine vertices was mentioned in this previous Answer. The elegant illustration below, the dual of the Herschel graph, is from David Eppstein:
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2041342%2f4-regular-planar-graph-is-unique%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Even if we fix the number of vertices, the (connected) $4$-regular planar graph of that order (number of vertices) may not be unique. According to work by Markus Meringer, author of GENREG, the only orders for which there is a unique such graph are likely to be $n=6,8,9$.
An antiprism graph with $2n$ vertices can be given as an example of a vertex-transitive (and therefore regular), polyhedral (and therefore planar) graph.
The pentagonal antiprism looks like this:
There is a different (non-isomorphic) $4$-regular planar graph with ten vertices, namely the elongated square dipyramid:
Non-isomorphism of the graphs can be demonstrated by counting edges of open neighborhoods in the two graphs. The open neighborhood of each vertex of the pentagonal antiprism has three edges forming a simple path. In the elongated square dipyramid some open neighborhoods have two edges that form a path and some have four edges that form a cycle.
Notes about the small odd vertex cases
The only $4$-regular graph on five vertices is $K_5$, which of course is not planar.
Nonexistence of any $4$-regular planar graph on seven vertices was the topic of this previous Question.
Uniqueness of the $4$-regular planar graph on nine vertices was mentioned in this previous Answer. The elegant illustration below, the dual of the Herschel graph, is from David Eppstein:
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
$endgroup$
add a comment |
$begingroup$
Even if we fix the number of vertices, the (connected) $4$-regular planar graph of that order (number of vertices) may not be unique. According to work by Markus Meringer, author of GENREG, the only orders for which there is a unique such graph are likely to be $n=6,8,9$.
An antiprism graph with $2n$ vertices can be given as an example of a vertex-transitive (and therefore regular), polyhedral (and therefore planar) graph.
The pentagonal antiprism looks like this:
There is a different (non-isomorphic) $4$-regular planar graph with ten vertices, namely the elongated square dipyramid:
Non-isomorphism of the graphs can be demonstrated by counting edges of open neighborhoods in the two graphs. The open neighborhood of each vertex of the pentagonal antiprism has three edges forming a simple path. In the elongated square dipyramid some open neighborhoods have two edges that form a path and some have four edges that form a cycle.
Notes about the small odd vertex cases
The only $4$-regular graph on five vertices is $K_5$, which of course is not planar.
Nonexistence of any $4$-regular planar graph on seven vertices was the topic of this previous Question.
Uniqueness of the $4$-regular planar graph on nine vertices was mentioned in this previous Answer. The elegant illustration below, the dual of the Herschel graph, is from David Eppstein:
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
$endgroup$
add a comment |
$begingroup$
Even if we fix the number of vertices, the (connected) $4$-regular planar graph of that order (number of vertices) may not be unique. According to work by Markus Meringer, author of GENREG, the only orders for which there is a unique such graph are likely to be $n=6,8,9$.
An antiprism graph with $2n$ vertices can be given as an example of a vertex-transitive (and therefore regular), polyhedral (and therefore planar) graph.
The pentagonal antiprism looks like this:
There is a different (non-isomorphic) $4$-regular planar graph with ten vertices, namely the elongated square dipyramid:
Non-isomorphism of the graphs can be demonstrated by counting edges of open neighborhoods in the two graphs. The open neighborhood of each vertex of the pentagonal antiprism has three edges forming a simple path. In the elongated square dipyramid some open neighborhoods have two edges that form a path and some have four edges that form a cycle.
Notes about the small odd vertex cases
The only $4$-regular graph on five vertices is $K_5$, which of course is not planar.
Nonexistence of any $4$-regular planar graph on seven vertices was the topic of this previous Question.
Uniqueness of the $4$-regular planar graph on nine vertices was mentioned in this previous Answer. The elegant illustration below, the dual of the Herschel graph, is from David Eppstein:
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
$endgroup$
Even if we fix the number of vertices, the (connected) $4$-regular planar graph of that order (number of vertices) may not be unique. According to work by Markus Meringer, author of GENREG, the only orders for which there is a unique such graph are likely to be $n=6,8,9$.
An antiprism graph with $2n$ vertices can be given as an example of a vertex-transitive (and therefore regular), polyhedral (and therefore planar) graph.
The pentagonal antiprism looks like this:
There is a different (non-isomorphic) $4$-regular planar graph with ten vertices, namely the elongated square dipyramid:
Non-isomorphism of the graphs can be demonstrated by counting edges of open neighborhoods in the two graphs. The open neighborhood of each vertex of the pentagonal antiprism has three edges forming a simple path. In the elongated square dipyramid some open neighborhoods have two edges that form a path and some have four edges that form a cycle.
Notes about the small odd vertex cases
The only $4$-regular graph on five vertices is $K_5$, which of course is not planar.
Nonexistence of any $4$-regular planar graph on seven vertices was the topic of this previous Question.
Uniqueness of the $4$-regular planar graph on nine vertices was mentioned in this previous Answer. The elegant illustration below, the dual of the Herschel graph, is from David Eppstein:
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
edited 2 days ago
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
answered Dec 6 '16 at 3:10
hardmathhardmath
29.2k953101
29.2k953101
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2041342%2f4-regular-planar-graph-is-unique%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Yes, I agree. We need something more than just $4$-regular and planar to make the graph unique. You give examples with $8$ vertices and with $12$ vertices. I can think of planar $4$-regular graphs with $10$ and with infinitely many vertices.
$endgroup$
– hardmath
Dec 3 '16 at 4:11
$begingroup$
One thought would be to check the textbook's definition. While you and I take $4$-regular to mean simply each vertex having degree $4$ (four edges at each vertex), it is possible the book defined it to mean something stronger.
$endgroup$
– hardmath
Dec 3 '16 at 4:15
$begingroup$
@hardmath, thanks, that's all the confirmation I need. Re: definition in the book, it just says "A graph $G$ is regular if every vertex has the same degree. $G$ is said to be regular of degree $r$ (or $r$-regular) if $deg(v) = r$ for all vertices $v$ in $G$." I wonder if there's some "we make such-and-such assumption only for this section" that I missed..
$endgroup$
– tilper
Dec 3 '16 at 4:18
$begingroup$
I added an image of the smallest such graph to this recent Question.
$endgroup$
– hardmath
Dec 3 '16 at 4:25
$begingroup$
The only thing I can imagine is that once you fix the order (the number of vertices) of the 4-regular planar graph then it might be unique.
$endgroup$
– Laars Helenius
Dec 3 '16 at 4:40