Bicircular matroids are 3-colorable

DOI10.1016/j.disc.2015.12.015zbMath1333.05063OpenAlexW2234839101MaRDI QIDQ271597

Nancy Ann Neudauer, Winfried Hochstättler, Luis A. Goddyn

Publication date: 7 April 2016

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

Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.015

zbMATH Keywords

matroidsoriented matroidscoloringsseries-parallel networks

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Oriented cobicircular matroids are \textit{GSP}

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Indicated coloring of matroids
• Antisymmetric flows in matroids
• On the chromatic number of an oriented matroid
• Hadwiger's conjecture is true for almost every graph
• On the enumeration of chains in regular chain-groups
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• The four-colour theorem
• On subgraphs as matroid cells
• Über eine Eigenschaft der ebenen Komplexe
• Balancing Covectors
• Every planar map is four colorable
• On (k,d)-colorings and fractional nowhere-zero flows
• Balanced Signings and the Chromatic Number of Oriented Matroids
• On the algebraic theory of graph colorings
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: Bicircular matroids are 3-colorable