Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (Q1427480): 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.1016/j.disc.2003.05.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2983506641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic equivalence of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatically unique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the chromaticity of some 2-connected \((n,n+3)\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two classes of 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: Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic uniqueness of the generalized \(\Theta\)-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to chromatic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic polynomials of homeomorphism classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutpoints and the chromatic polynomial / rank
 
Normal rank

Latest revision as of 15:27, 6 June 2024

scientific article
Language Label Description Also known as
English
Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles.
scientific article

    Statements

    Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. (English)
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    0 references
    Chromatic polynomial
    0 references
    Chromatically equivalent
    0 references
    Chromatically unique
    0 references
    0 references