The method of coloring in graphs and its application (Q2429917): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s11424-010-0211-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2163432100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling File Transfers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the f-coloring of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fg-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of edge-coloring in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decompositions of a multi-graph into spanning subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note to the paper of Grünbaum on acyclic colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542572 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds on acyclic edge colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colorings of planar graphs and series parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge coloring of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: About acyclic edge colourings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge colouring of planar graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge chromatic number of outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of acyclic edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some graphs of class 1 for \(f\)-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(f\)-colorings of some graphs of \(f\)-class 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient conditions for a graph to be of \(C_f\) 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3070254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The classification of complete graphs \(K_n\) on \(f\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results about <i>f</i>‐critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5430225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the edge cover chromatic index of multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Topics on Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4316457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the \((g, f)\)-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for equitable edge-colourings of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5455780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring the Edges of a Multigraph so that Each Vertex has at Most <i>j</i> , or at Least <i>j</i> , Edges of Each Colour on it / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5344765 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge covering coloring and fractional edge covering coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the acyclic choosability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge covered critical multigraphs / rank
 
Normal rank

Latest revision as of 23:13, 3 July 2024

scientific article
Language Label Description Also known as
English
The method of coloring in graphs and its application
scientific article

    Statements

    The method of coloring in graphs and its application (English)
    0 references
    5 April 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references