An upper bound for the choice number of star edge coloring of graphs (Q2008856): 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.1016/j.amc.2018.12.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2905740390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Edge Coloring of Some Classes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum average degree and the oriented chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bound for the degenerate and star chromatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 6-Star-Coloring of Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star Chromatic Index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic edge-coloring using entropy compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: List star edge-coloring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star coloring bipartite planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic index of subcubic multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star 5-edge-colorings of subcubic multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5322832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star chromatic index of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-partition and star chromatic index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star edge-coloring of graphs with maximum degree four / rank
 
Normal rank

Latest revision as of 02:14, 21 July 2024

scientific article
Language Label Description Also known as
English
An upper bound for the choice number of star edge coloring of graphs
scientific article

    Statements

    An upper bound for the choice number of star edge coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 November 2019
    0 references
    star edge coloring
    0 references
    choice number
    0 references
    star chromatic index
    0 references
    entropy compression
    0 references

    Identifiers