Three tree-paths

DOI10.1002/jgt.3190130205zbMath0698.05049MaRDI QIDQ3475297

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130205

zbMATH Keywords

paths; 3-connected graph; spanning trees; extended 3-tree graph property

Mathematics Subject Classification ID

05C05: Trees

05C38: Paths and cycles

05C15: Coloring of graphs and hypergraphs

05C40: Connectivity

Related Items

Unnamed Item, Completely independent spanning trees in torus networks, CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2^m, 2), A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS, Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees, Independent spanning trees with small depths in iterated line digraphs, Independent spanning trees in crossed cubes, Independent spanning trees of chordal rings, A comment on ``Independent spanning trees in crossed cubes, Construction of optimal independent spanning trees on folded hypercubes, A parallel algorithm for constructing independent spanning trees in twisted cubes, Constructing independent spanning trees for locally twisted cubes, Independent spanning trees on even networks, Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes, Spanning trees: A survey, Independent spanning trees on twisted cubes, On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\), On independent spanning trees, Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity, Reliable broadcasting in product networks, A multi-tree routing scheme using acyclic orientations, Power assignment for \(k\)-connectivity in wireless ad hoc networks, An algorithm to construct independent spanning trees on parity cubes, Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs, Structural properties of subdivided-line graphs, Broadcasting secure messages via optimal independent spanning trees in folded hypercubes, Construction independent spanning trees on locally twisted cubes in parallel, Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits, Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes, Mondshein Sequences (a.k.a. (2,1)-Orders), Independent spanning trees on folded hyper-stars, Four Edge-Independent Spanning Trees

Cites Work

Unnamed Item