On the chromatic equivalence class of a family of graphs (Q1356678): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic uniqueness of certain broken wheels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromaticity of certain graphs with five triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to chromatic polynomials / rank
 
Normal rank

Revision as of 14:12, 27 May 2024

scientific article
Language Label Description Also known as
English
On the chromatic equivalence class of a family of graphs
scientific article

    Statements

    On the chromatic equivalence class of a family of graphs (English)
    0 references
    7 July 1997
    0 references
    0 references
    chromatic polynomial
    0 references
    chromatically equivalent
    0 references
    path
    0 references
    chromatic equivalence class
    0 references
    0 references