Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (Q1025926): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yee-Hock Peng / rank
Normal rank
 
Property / author
 
Property / author: Yee-Hock Peng / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.08.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050825359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic equivalence of 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: Chromatic classes of 2-connected \((n,n+3)\)-graphs with at least two triangles / 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: Chromatic classes of 2-connected \((n,n+4)\)-graphs with at least four triangles. / 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
Property / cites work
 
Property / cites work: Q5790850 / rank
 
Normal rank

Latest revision as of 17:28, 1 July 2024

scientific article
Language Label Description Also known as
English
Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle
scientific article

    Statements

    Chromatic classes of 2-connected \((n,n+4)\)-graphs with three triangles and one induced 4-cycle (English)
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    0 references
    chromatic polynomial
    0 references
    chromatically unique graph
    0 references
    chromatically equivalent graph
    0 references
    relative-closed
    0 references
    0 references