Properly colored and rainbow copies of graphs with few cherries (Q5890911): Difference between revisions

From MaRDI portal
Page on [mardi] deleted: Publication:5890911
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
description / endescription / en
 
scientific article; zbMATH DE number 6656172
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1350.05042 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/j.jctb.2016.07.001 / rank
 
Normal rank
Property / published in
 
Property / published in: Journal of Combinatorial Theory. Series B / rank
 
Normal rank
Property / publication date
 
25 November 2016
Timestamp+2016-11-25T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 25 November 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6656172 / rank
 
Normal rank
Property / zbMATH Keywords
 
rainbow subgraphs
Property / zbMATH Keywords: rainbow subgraphs / rank
 
Normal rank
Property / zbMATH Keywords
 
properly colored subgraphs
Property / zbMATH Keywords: properly colored subgraphs / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2762214683 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56226594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicoloured Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4358434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly coloured copies and rainbow copies of large graphs with small maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Hamiltonian cycles having adjacent lines different colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow trees and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path and cycle sub-Ramsey numbers and an edge-colouring conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polychromatic cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicolored subsets in colored hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly coloured Hamiltonian cycles in edge-coloured complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Lovász local lemma in the space of random injections / rank
 
Normal rank
Property / cites work
 
Property / cites work: A property of the colored complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lopsided Lovász Local lemma and Latin transversals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:38, 13 July 2024

scientific article; zbMATH DE number 6656172
Language Label Description Also known as
English
Properly colored and rainbow copies of graphs with few cherries
scientific article; zbMATH DE number 6656172

    Statements

    Properly colored and rainbow copies of graphs with few cherries (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    25 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Ramsey-type problems
    0 references
    rainbow and properly colored subgraphs
    0 references
    spanning subgraphs
    0 references
    local lemma
    0 references
    rainbow subgraphs
    0 references
    properly colored subgraphs
    0 references
    0 references
    0 references
    0 references
    0 references