AbstractWe prove the conjecture of Jackson and Wormald that every 3-connected planar graph has a closed walk visiting every vertex once or twice. This strengthens Barnette′s Theorem that every 3-connected planar graph has a spanning tree with maximum degree at most 3. The result also holds for 3-connected projective planar graphs
In this paper, we present a result concerning the relation between the path-with of a planar graph a...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing...
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing...
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
AbstractThere are two main purposes of this article. First we show that every 3-connected graph embe...
AbstractThere are two main purposes of this article. First we show that every 3-connected graph embe...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
This article uses the discharging method to obtain the best possible results that a 3-connected grap...
AbstractThomassen conjectured that every longest circuit of a 3-connected graph has a chord. The con...
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected ...
In this paper, we present a result concerning the relation between the path-with of a planar graph a...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing...
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing...
A 2-walk of a graph is a walk visiting every vertex at least once and at most twice. By generalizing...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
AbstractThere are two main purposes of this article. First we show that every 3-connected graph embe...
AbstractThere are two main purposes of this article. First we show that every 3-connected graph embe...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractA 2-walk is a closed spanning trail which uses every vertex at most twice. A graph is said t...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
This article uses the discharging method to obtain the best possible results that a 3-connected grap...
AbstractThomassen conjectured that every longest circuit of a 3-connected graph has a chord. The con...
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected ...
In this paper, we present a result concerning the relation between the path-with of a planar graph a...
We prove that any planar graph on n vertices has less than 5:2852n spanning trees. Under the restric...
Theorem 1. (1) A planar graph with n vertices has at most 5.33333333... n spanning trees. (2) A plan...
DOI
Add to ORKG