A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index (Q1706430): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-017-1863-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2773291755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(t\)-tone chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4566363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in \(t\)-tone coloring of graphs / rank
 
Normal rank

Latest revision as of 08:09, 15 July 2024

scientific article
Language Label Description Also known as
English
A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index
scientific article

    Statements

    A lower bound for the \(t\)-tone chromatic number of a graph in terms of Wiener index (English)
    0 references
    0 references
    0 references
    22 March 2018
    0 references
    \(t\)-tone chromatic number
    0 references
    Wiener index
    0 references

    Identifiers