Relatively Bridge-Addable Classes of Graphs

DOI10.1007/978-3-642-54423-1_34MaRDI QIDQ5405058zbMATH OpenOpenAlexFDO

Authors Kerstin Weller, Colin 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)

Recommendations

• Connectivity for Bridge-addable monotone graph classes
• Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
• Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture
• Connectivity of addable graph classes
• Local convergence and stability of tight bridge-addable graph classes
• Connectivity for bridge-alterable graph classes
• Connectivity for random graphs from a weighted bridge-addable class
• Bridge graphs and their topological indices
• Additively graceful graphs
• The Connectivity of addition Cayley graphs

Cited in

(7)

• Connectivity for bridge-alterable graph classes
• Bridge-addability, edge-expansion and connectivity
• On random graphs from a minor-closed class
• Local convergence and stability of tight bridge-addable graph classes
• Connectivity for random graphs from a weighted bridge-addable class
• Connectivity of addable graph classes
• Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture

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

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