A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (Q2674382): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3207744794 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2110.08004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5140719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm to recognize even-hole-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part I: Decomposition theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even-hole-free graphs part II: Recognition algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of even-hole-free graphs with star cutsets and 2-joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection of two vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Integer Programming and Convolution. / 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: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank

Latest revision as of 03:16, 30 July 2024

scientific article
Language Label Description Also known as
English
A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)
scientific article

    Statements

    A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\) (English)
    0 references
    0 references
    12 September 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    neighborhood diversity
    0 references
    integer programming
    0 references
    0 references
    0 references