On a base exchange game on bispanning graphs

DOI10.1016/j.dam.2013.08.016zbMath1288.05172OpenAlexW2068702395MaRDI QIDQ2448909

M. Merkel, Winfried Hochstättler, Stephan Dominique Andres

Publication date: 5 May 2014

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

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.016

zbMATH Keywords

wheelbispanning graphbasis exchangemaker-breaker gameunique single element exchange

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

Weighted exchange distance of basis pairs

Cites Work

• Unnamed Item
• Unnamed Item
• A base exchange property for regular matroids
• Cyclic orderings and cyclic arboricity of matroids
• The toric ideal of a graphic matroid is generated by quadrics
• Ordering of the elements of a matroid such that its consecutive w elements are independent
• Decomposition of regular matroids
• A unique exchange property for bases
• Edge‐disjoint spanning trees: A connectedness theorem
• Matroid intersection algorithms
• Decomposing symmetric exchanges in matroid bases

This page was built for publication: On a base exchange game on bispanning graphs