12:28 AM
1
Let $T$ be a given (finite) tree. Question 1: Is it always possible to add edges to $T$ to obtain a $2$-connected outerplanar supergraph $G$? Question 2: If the answer to Question #1 is negative, can the trees for which it is possible be characterized? Question 3( Defect form of Question 1): Let ...
In graph theory, an outerplanar graph is a graph that has a planar drawing for which all vertices belong to the outer face of the drawing.
Outerplanar graphs may be characterized (analogously to Wagner's theorem for planar graphs) by the two forbidden minors K4 and K2,3, or by their Colin de Verdière graph invariants.
They have Hamiltonian cycles if and only if they are biconnected, in which case the outer face forms the unique Hamiltonian cycle. Every outerplanar graph is 3-colorable, and has degeneracy and treewidth at most 2.
The outerplanar graphs are a subset of the planar graphs, the subgraphs...
11 hours later…
11:00 AM
I am just curious, when somebody comes and says: "Why did you edit those links? They should have stayed as they were."
On November 2 there were about 480 posts: chat.stackexchange.com/transcript/10243/2021/11/2 On January 2 about 430: chat.stackexchange.com/transcript/10243/2022/1/2
Users with most posts containing the front.math.ucdavis.edu and Users with most posts where front.math.ucdavis.edu was removed
> All links starting with
front.math.ucdavis.edu/math/
followed by 00 to 06 were before 2007. SEDE returns 194 posts and 63 comments.
« first day (3085 days earlier) ← previous day next day → last day (815 days later) »