On a base exchange game on bispanning graphs

DOI10.1016/J.DAM.2013.08.016zbMATH Open1288.05172OpenAlexW2068702395MaRDI QIDQ2448909FDOQ2448909

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

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

Recommendations

• Spanning tree game as prim would have played
• Global maker-breaker games on sparse graphs
• Partitioning bispanning graphs into spanning trees
• Building spanning trees quickly in maker-breaker games
• Building spanning trees quickly in maker-breaker games

zbMATH Keywords

wheelbispanning graphbasis exchangemaker-breaker gameunique single element exchange

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (1)

• Weighted exchange distance of basis pairs

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

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