Relatively Bridge-Addable Classes of Graphs

DOI10.1007/978-3-642-54423-1_34zbMath1406.05097OpenAlexW626778207MaRDI QIDQ5405058

Kerstin Weller, Colin J. H. McDiarmid

Publication date: 31 March 2014

Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-54423-1_34

zbMATH Keywords

random graphsexpander graphslabelled graphsbridge-addableforests in \(K _{n,n }\)

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

This page was built for publication: Relatively Bridge-Addable Classes of Graphs