The total chromatic number of some bipartite graphs (Q3439400): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Colour Numbers of Complete Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre Chromatique Total Du Graphe <i>R</i> -Parti Complet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colorings of planar graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total colourings of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total chromatic number of completer-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of complete multipartite 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: 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 9-coloring planar graphs of maximum degree seven / 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: Total Colourings of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815316 / rank
 
Normal rank

Latest revision as of 19:09, 25 June 2024

scientific article
Language Label Description Also known as
English
The total chromatic number of some bipartite graphs
scientific article

    Statements

    Identifiers