Improved approximation for maximum edge colouring problem (Q2161229): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Approximation and Hardness Results for the Maximum Edge q-coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and hardness results for the maximum edge \(q\)-coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of erdöus, simonovits, and sós concerning anti‐Ramsey theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite anti-Ramsey numbers of cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey colorings in several rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithm for maximum edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A rainbow \(k\)-matching in the complete graph with \(r\) colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow numbers for small stars with one edge added / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The anti-Ramsey number of perfect matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-Ramsey numbers of subdivided graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings with no large polychromatic stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős–Simonovits–Sós Conjecture about the Anti-Ramsey Number of a Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-colorings of complete graphs that avoid polychromatic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal colorings for properly colored subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On totally multicolored stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An anti-Ramsey theorem on cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow numbers for matchings and complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restricted colourings of \(K_ n\) / rank
 
Normal rank

Latest revision as of 20:27, 29 July 2024

scientific article
Language Label Description Also known as
English
Improved approximation for maximum edge colouring problem
scientific article

    Statements

    Improved approximation for maximum edge colouring problem (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    graph algorithm
    0 references
    graph colouring
    0 references
    anti-Ramsey number
    0 references
    0 references
    0 references
    0 references