A lower bound on the independence number of a graph (Q1584341): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GRAFFITI / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On conjectures of Graffiti / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the residue of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence and the Havel-Hakimi residue / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Dominating Sets and Independent Sets of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3230887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the stability number of graphs computed in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The independence number of graphs in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic lower bound on the independence number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879171 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:05, 30 May 2024

scientific article
Language Label Description Also known as
English
A lower bound on the independence number of a graph
scientific article

    Statements