On the Independence Number of Graphs with Maximum Degree 3 (Q3104780): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Iyad A. Kanj / rank
Normal rank
 
Property / author
 
Property / author: Iyad A. Kanj / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1921482839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximation properties of the independent set problem for low degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3872499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 11/30 (Finding large independent sets in connected triangle-free 3- regular 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: The independence number in graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the independence ratio of triangle-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size and independence in triangle‐free graphs with maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramsey-Type Numbers and the Independence Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple and Fast Algorithm for Maximum Independent Set in 3-Degree Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:40, 4 July 2024

scientific article
Language Label Description Also known as
English
On the Independence Number of Graphs with Maximum Degree 3
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references