AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum valence 15. We give an example of a planar 3-connected graph with no spanning 2-connected subgraph of maximum valence five
AbstractWe prove that every 3-connected planar graph whose minimum degree is greater than or equal t...
AbstractWe prove that every 3-connected planar graph G of order at least k contains a connected subg...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractWe prove that every 3-connected planar graph whose minimum degree is greater than or equal t...
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
AbstractWe prove the conjecture of Jackson and Wormald that every 3-connected planar graph has a clo...
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...
AbstractThe problem of finding a two-connected planar spanning subgraph of maximum weight in a compl...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
AbstractWe prove that every 3-connected planar graph whose minimum degree is greater than or equal t...
AbstractWe prove that every 3-connected planar graph G of order at least k contains a connected subg...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
AbstractWe prove that every planar 3-connected graph has a 2-connected spanning subgraph of maximum ...
AbstractWe prove that every 3-connected planar graph whose minimum degree is greater than or equal t...
In this paper we show that every 3-connected (3-edge-connected) planar graph contains a 2-connected ...
This paper considers the conjecture by Grünbaum that every planar 3-connected graph has a spanning ...
AbstractWe prove the conjecture of Jackson and Wormald that every 3-connected planar graph has a clo...
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...
AbstractThe problem of finding a two-connected planar spanning subgraph of maximum weight in a compl...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
The problem of finding in a complete edge-weighted graph a two-connected planar spanning subgraph of...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractMcCuaig and Ota conjectured that every sufficiently large 3-connected graph G contains a con...
AbstractWe prove that every 3-connected planar graph whose minimum degree is greater than or equal t...
AbstractWe prove that every 3-connected planar graph G of order at least k contains a connected subg...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
DOI
Add to ORKG