Cyclic orderings and cyclic arboricity of matroids

DOI10.1016/j.jctb.2011.08.004zbMath1241.05060arXiv0912.2929OpenAlexW2020928988MaRDI QIDQ414636

Jan van den Heuvel, Steéphan Thomassé

Publication date: 11 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

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

zbMATH Keywords

matroidarboricitybase of a matroidcircular arboricitycyclic ordering

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

On Serial Symmetric Exchanges of Matroid Bases ⋮ Exchange Distance of Basis Pairs in Split Matroids ⋮ On a base exchange game on bispanning graphs ⋮ On Sequential Basis Exchange in Matroids ⋮ On the Complexity of Digraph Colourings and Vertex Arboricity ⋮ Non-preemptive tree packing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bases-cobases graphs and polytopes of matroids
• Ordering of the elements of a matroid such that its consecutive w elements are independent
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• Equicovering matroids by distinct bases
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Decomposing symmetric exchanges in matroid bases
• Minimum partition of a matroid into independent subsets
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Decomposition of Finite Graphs Into Forests
• Circular chromatic number: A survey

This page was built for publication: Cyclic orderings and cyclic arboricity of matroids