scientific article; zbMATH DE number 2079338

MaRDI QIDQ4471293zbMATH OpenFDO

Authors Sean Curran, Orlando Lee, Xingxing Yu

Publication date 28 July 2004

zbMATH Keywords

distributed networksmultitreereliability

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Chain Decompositions of 4-Connected Graphs
• Nonseparating Planar Chains in 4-Connected Graphs
• Finding Four Independent Trees
• Four edge-independent spanning trees
• A charcterization of 4‐edge‐connected eulerian graphs

Cited in

(7)

• A chain theorem for 4-connected graphs
• Connect four and graph decomposition
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• A charcterization of 4‐edge‐connected eulerian graphs
• Finding Four Independent Trees
• Nonseparating Planar Chains in 4-Connected Graphs
• Chain Decompositions of 4-Connected Graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471293)