On the number of boundary classes in the 3-colouring problem (Q3225901): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 3-Colorability Problem on Graphs with Maximum Degree Four / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On easy and hard hereditary classes of graphs with respect to the independent set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithm for finding the largest independent sets in graphs without forks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary classes of graphs for the dominating set problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:17, 5 July 2024

scientific article
Language Label Description Also known as
English
On the number of boundary classes in the 3-colouring problem
scientific article

    Statements