Some families of chromatically unique bipartite graphs (Q1584227): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic equivalence of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5283993 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search for chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search for chromatically unique graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic uniqueness of certain bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromaticity of complete bipartite graphs with at most one edge deleted / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0012-365x(97)00203-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006170146 / rank
 
Normal rank

Latest revision as of 12:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Some families of chromatically unique bipartite graphs
scientific article

    Statements

    Some families of chromatically unique bipartite graphs (English)
    0 references
    2 November 2000
    0 references
    chromatically unique
    0 references
    chromatic polynomial
    0 references
    chromaticity
    0 references
    0 references

    Identifiers