Augmenting a tree to a k-arbor-connected graph with pagenumber k
From MaRDI portal
(Redirected from Publication:2115870)
Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
Cites work
- scientific article; zbMATH DE number 177556 (Why is no real title available?)
- scientific article; zbMATH DE number 1953097 (Why is no real title available?)
- A linear-time algorithm for solving the center problem on weighted cactus graphs
- Augmenting Outerplanar Graphs
- Augmenting the connectivity of geometric graphs
- Augmenting the connectivity of planar and geometric graphs
- Augmenting undirected node-connectivity by one
- Completely independent spanning trees in some regular graphs
- Completely independent spanning trees in the underlying graph of a line digraph
- Constructing completely independent spanning trees in crossed cubes
- Constructing two completely independent spanning trees in hypercube-variant networks
- Dirac's condition for completely independent spanning trees
- Edge-connectivity augmentation problems
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding planar graphs in four pages
- Four pages are indeed necessary for planar graphs
- Independence free graphs and vertex connectivity augmentation
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
- Planar graphs that need four pages
- Plane geometric graph augmentation: a generic perspective
- The book thickness of a graph
- Two counterexamples on completely independent spanning trees
This page was built for publication: Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115870)
