In general a planar graph can be drawn in many different ways. Can a planar graph that has a cycle of length three nevertheless not have any planar representation which includes a face of degree three?
2026-03-30 08:32:37.1774859557
Can a planar graph with a 3-cycle always be drawn with a 3-sided face?
114 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in GRAPH-THEORY
- characterisation of $2$-connected graphs with no even cycles
- Explanation for the static degree sort algorithm of Deo et al.
- A certain partition of 28
- decomposing a graph in connected components
- Is it true that if a graph is bipartite iff it is class 1 (edge-coloring)?
- Fake induction, can't find flaw, every graph with zero edges is connected
- Triangle-free graph where every pair of nonadjacent vertices has exactly two common neighbors
- Inequality on degrees implies perfect matching
- Proving that no two teams in a tournament win same number of games
- Proving that we can divide a graph to two graphs which induced subgraph is connected on vertices of each one
Related Questions in PLANAR-GRAPHS
- max planarity and triangulation
- How to find a minimal planar covering of a graph
- Complete bipartite planar graphs
- Is graph Planar?
- Kuratowski's theorem on Planar graphs
- Graph Theory: Degree of regions in a planar graph
- On the Hex/Nash connection game theorem
- Graph Theory: There is only one planar graph with all vertices of degree 4 and 10 regions
- Intersection of circles and regions
- Which of these graphs is planar?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
I started by guessing that any graph with a 3-cycle can be drawn in a planar embedding with a 3-face. I started to consider how to "flip" sections of the graph from inside the cycle to outside, and realized that if there is both an exterior and interior graph connected to all three points of the 3-cycle, this cannot be achieved.
Therefore I believe this graph, with its (only) 3-cycle highlighted in green, cannot be drawn with a 3-face:
(If the degree-2 nodes are considered undesirable, you can add another 4-cycle, connected pointwise, inside each of the interior and exterior 4-cycles (turn the 4-cycles into cube nets).)
As proof I suppose that we can, indeed, draw this graph with the 3-cycle $abc$ as a face. Then we can also add a point $d$ in the middle of the face and connect to the points of the 3-cycle and that too will be planar. However if we reduce the 4-cycles that are currently wholly exterior and wholly interior to the 3-cycle to points $e$ and $f$ then we can see there is a $K_{3,3}$ minor with $(a,b,c)$ on one part and $(d,e,f)$ in the other, contradicting that the graph with the extra point is planar.