Efficiently Coloring the Intersection of a General Matroid and Combinatorial Matroids
- 13 June 2026
- book chapter
- Published by Springer Nature
- p. 346-361
Abstract
No abstract availableAll Related Versions
This publication has 21 references indexed in Scilit:
- Coloring, list coloring, and fractional coloring in intersections of matroidsCombinatorica, 2025
- Partitioning into common independent sets via relaxing strongly base orderabilityJournal of Combinatorial Theory, Series A, 2023
- On the complexity of packing rainbow spanning treesDiscrete Mathematics, 2022
- Complexity of packing common bases in matroidsMathematical Programming, 2020
- Edge-coloring of 3-uniform hypergraphsDiscrete Applied Mathematics, 2017
- Connections in Combinatorial OptimizationDiscrete Applied Mathematics, 2012
- Independent systems of representatives in weighted graphsCombinatorica, 2007
- A condition for matchability in hypergraphsGraphs and Combinatorics, 1995
- The List Chromatic Index of a Bipartite MultigraphJournal of Combinatorial Theory, Series B, 1995
- On the relations of various conjectures on Latin squares and straightening coefficientsDiscrete Mathematics, 1994