Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
type: Item
instance of: scholarly article
title: Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
DOI: 10.1007/978-3-030-79987-8_25
author: Toru Hasunuma
publication date: 2022-03-22T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
Mathematics Subject Classification ID: 68Wxx
zbMATH DE Number: 7495034
zbMATH Keywords: arbor-connectedness
zbMATH Keywords: augmentation
zbMATH Keywords: cactus
zbMATH Keywords: pagenumber
zbMATH Keywords: trees
MaRDI profile type: Publication
full work available at URL: 978-3-030-79987-8 25
OpenAlex ID: W3176550641
cites work: Augmenting the connectivity of geometric graphs
cites work: Dirac's Condition for Completely Independent Spanning Trees
cites work: Four pages are indeed necessary for planar graphs
cites work: The book thickness of a graph
cites work: Constructing completely independent spanning trees in crossed cubes
cites work: Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
cites work: Completely independent spanning trees in some regular graphs
cites work: Completely independent spanning trees in the underlying graph of a line digraph
cites work: Q4414501
cites work: Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
cites work: Plane Geometric Graph Augmentation: A Generic Perspective
cites work: Independence free graphs and vertex connectivity augmentation
cites work: Augmenting Outerplanar Graphs
cites work: Q4037427
cites work: A linear-time algorithm for solving the center problem on weighted cactus graphs
cites work: Constructing two completely independent spanning trees in hypercube-variant networks
cites work: Two counterexamples on completely independent spanning trees
cites work: Augmenting the Connectivity of Planar and Geometric Graphs
cites work: Augmenting Undirected Node-Connectivity by One
cites work: Edge-connectivity augmentation problems
cites work: Embedding planar graphs in four pages
cites work: Planar graphs that need four pages
description: scientific article; zbMATH DE number 7495034