Decomposable polymatroids and connections with graph coloring

DOI10.1016/j.ejc.2020.103179zbMath1447.05047arXiv1908.09030OpenAlexW3038101661MaRDI QIDQ2198995

Carolyn Chun, Joseph E. Bonin

Publication date: 15 September 2020

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

chromatic numberchromatic polynomials

Mathematics Subject Classification ID

Graph polynomials (05C31) 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 (2)

The Excluded Minors for Three Classes of 2-Polymatroids Having Special Types of Natural Matroids ⋮ The Natural Matroid of an Integer Polymatroid

Cites Work

• Deletion-contraction to form a polymatroid
• Some excluded-minor theorems for a class of polymatroids
• Uniqueness of the decomposition of the rank function of a 2-polymatroid
• Branch-width and Rota's conjecture
• The reconstruction of a matroid from its connectivity function
• On the connectivity function of a binary matroid
• Discrete polymatroids
• Excluded minors for Boolean polymatroids
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposable polymatroids and connections with graph coloring