Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)

DOI10.1007/978-3-030-79987-8_25OpenAlexW3176550641MaRDI QIDQ2115870

Toru Hasunuma

Publication date: 22 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_25

zbMATH Keywords

augmentationtreescactuspagenumberarbor-connectedness

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing two completely independent spanning trees in hypercube-variant networks
• Two counterexamples on completely independent spanning trees
• Constructing completely independent spanning trees in crossed cubes
• Completely independent spanning trees in some regular graphs
• Augmenting the connectivity of geometric graphs
• Edge-connectivity augmentation problems
• Embedding planar graphs in four pages
• The book thickness of a graph
• A linear-time algorithm for solving the center problem on weighted cactus graphs
• Independence free graphs and vertex connectivity augmentation
• Planar graphs that need four pages
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Plane Geometric Graph Augmentation: A Generic Perspective
• Dirac's Condition for Completely Independent Spanning Trees
• Augmenting Undirected Node-Connectivity by One
• Augmenting the Connectivity of Planar and Geometric Graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Augmenting Outerplanar Graphs
• Four pages are indeed necessary for planar graphs
• Completely independent spanning trees in the underlying graph of a line digraph

This page was built for publication: Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)