scientific article; zbMATH DE number 1112370

zbMATH Open0886.05083MaRDI QIDQ4374002FDOQ4374002

Zhongxi Mo, Pusheng Fei

Publication date: 4 February 1998

Title of this publication is not available (Why is that?)

zbMATH Keywords

lower boundindependence number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (12)

• New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth
• The lower bound on independence number.
• New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph
• A new notion of vertex independence and rank for finite graphs
• A lower bound on the independence number of a graph
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
• Lower bounds on size and independence inK4-free graphs
• An upper bound on the independence number of a graph computable in polynomial-time
• Lower bounds on the independence number of certain graphs of odd girth at least seven
• Title not available (Why is that?)
• Improved lower bounds on k‐independence
• New results on \(k\)-independence of graphs

   Recommendations

• A new lower bound on the independence number of graphs 👍 👎
• An improved lower bound on the independence number of a graph 👍 👎
• A lower bound on the independence number of a graph 👍 👎
• Bounds on the independence number of a graph in terms of order, size and maximum degree 👍 👎
• A lower bound on the independence number of a graph in terms of degrees 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4374002)