Decomposable polymatroids and connections with graph coloring (Q2198995): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3728007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deletion-contraction to form a polymatroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-width and Rota's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the connectivity function of a binary matroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of the decomposition of the rank function of a 2-polymatroid / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of a matroid from its connectivity function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excluded minors for Boolean polymatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5390304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some excluded-minor theorems for a class of polymatroids / rank
 
Normal rank

Latest revision as of 15:38, 23 July 2024

scientific article
Language Label Description Also known as
English
Decomposable polymatroids and connections with graph coloring
scientific article

    Statements

    Decomposable polymatroids and connections with graph coloring (English)
    0 references
    0 references
    0 references
    15 September 2020
    0 references
    chromatic number
    0 references
    chromatic polynomials
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references