The structure of graphs with a vital linkage of order 2

DOI10.1002/jgt.20640zbMath1248.05128arXiv1006.5485OpenAlexW2170225746MaRDI QIDQ2911061

Stefan H. M. Van Zwam, Dillon Mayhew, Geoffrey P. Whittle

Publication date: 12 September 2012

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

Full work available at URL: https://arxiv.org/abs/1006.5485

zbMATH Keywords

minorslinkage

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Rigid linkages and partial zero forcing

Cites Work

• Graph minors. XXI. graphs with unique linkages
• A decomposition theory for matroids. VI: Almost regular matroids
• The excluded minors for the class of matroids that are binary or ternary
• A shorter proof of the graph minor algorithm

This page was built for publication: The structure of graphs with a vital linkage of order 2