Between 2- and 3-colorability (Q5902303): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4369478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The speed of hereditary properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisplit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Difference graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of (O,P)-partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the size of hereditary classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Deletion Problems on Bipartite Graphs / rank
 
Normal rank

Latest revision as of 06:38, 2 July 2024

scientific article; zbMATH DE number 5642338
Language Label Description Also known as
English
Between 2- and 3-colorability
scientific article; zbMATH DE number 5642338

    Statements

    Between 2- and 3-colorability (English)
    0 references
    0 references
    4 December 2009
    0 references
    0 references
    3-colorability
    0 references
    polynomial-time algorithm
    0 references
    hereditary class of graphs
    0 references
    computational complexity
    0 references
    0 references