Total coloring of certain classes of product graphs (Q327644): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Grands Graphes De Degré Et Diamètre Fixés / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of planar graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roots of independence polynomials of well covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colouring regular bipartite graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On large (Δ, 6)-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3712354 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two new families of large compound graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total chromatic number of graphs having large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472727 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total coloring of a multigraph with maximal degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The total chromatic number of any multigraph with maximum degree five is at most seven / rank
 
Normal rank
Property / cites work
 
Property / cites work: New largest known graphs of diameter 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the total colouring number is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Total Chromatic Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME UNSOLVED PROBLEMS IN GRAPH THEORY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3480060 / rank
 
Normal rank

Latest revision as of 17:59, 12 July 2024

scientific article
Language Label Description Also known as
English
Total coloring of certain classes of product graphs
scientific article

    Statements

    Total coloring of certain classes of product graphs (English)
    0 references
    0 references
    0 references
    19 October 2016
    0 references
    total coloring
    0 references
    compound graph
    0 references
    product graph
    0 references
    bipartite graphs
    0 references
    complete graphs
    0 references

    Identifiers