Communication in m-connected graphs

DOI10.1016/0166-218X(90)90010-AzbMath0721.05042OpenAlexW2069528876MaRDI QIDQ2640619

Adam Idzik

Publication date: 1990

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(90)90010-a

zbMATH Keywords

vertex partitionm-connected graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (1)

A diameter-revealing proof of the Bondy-Lovász lemma

Cites Work

• A homology theory for spanning tress of a graph
• Depth-First Search and Linear Graph Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Communication in m-connected graphs