About chromatic uniqueness of some complete tripartite graphs (Q2285184): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5313291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The search for chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3450089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3450091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic uniqueness of elements of height \(\leq 3\) in lattices of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete solution to a conjecture on chromatic uniqueness of complete tripartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: About chromatic uniqueness of complete tripartite graph \(K(s, s - 1, s - k)\), where \(k\geq1\) and \(s - k\geq 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lattice of integer partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the partition lattice of all integers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum real roots of the \(\sigma\)-polynomials and chromatic uniqueness of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3565115 / rank
 
Normal rank

Revision as of 11:00, 21 July 2024

scientific article
Language Label Description Also known as
English
About chromatic uniqueness of some complete tripartite graphs
scientific article

    Statements

    Identifiers