Rainbow independent sets on dense graph classes (Q831859): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q591553
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Min-Ki Kim / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3159303669 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2001.10566 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow matchings in \(r\)-partite \(r\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large rainbow matchings in general graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Badges and rainbow matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdös--Hajnal Properties for Powers of Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Map graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds to the clique width of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in row-latin rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-Order Interpretations of Bounded Expansion Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4625695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexes of graphs with bounded independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On low rank-width colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grad and classes with bounded expansion. I: Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nowhere dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering powers of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterisations and examples of graph classes with bounded expansion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-width and vertex-minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with bounded generalized colouring number / rank
 
Normal rank

Latest revision as of 11:40, 28 July 2024

scientific article
Language Label Description Also known as
English
Rainbow independent sets on dense graph classes
scientific article

    Statements

    Rainbow independent sets on dense graph classes (English)
    0 references
    0 references
    0 references
    0 references
    24 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    bounded neighborhood diversity
    0 references
    bounded expansion class
    0 references
    0 references
    0 references