Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114053747 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1507.07194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced degenerate subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new lower bound on the independence number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approach to the \(k\)-independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the independence number in terms of the degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on independence in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of a graph in terms of order and size / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound on the independence number of a graph in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726281 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / 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: <i>k</i>-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smallest-last ordering and clustering and graph coloring algorithms / 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: Balanced graphs and network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on greedy algorithms for the maximum weighted independent set problem / 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: Q5781249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs / rank
 
Normal rank

Latest revision as of 16:07, 11 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees
scientific article

    Statements

    Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (English)
    0 references
    0 references
    18 March 2016
    0 references
    independent set
    0 references
    \(k\)-independent set
    0 references
    degeneracy
    0 references
    greedy algorithm
    0 references

    Identifiers