scientific article; zbMATH DE number 6383843

MaRDI QIDQ2936700zbMATH OpenFDO

Authors Mostafa Blidia, Ahmed Bouchou, Lutz Volkmann

Publication date 6 January 2015

zbMATH Keywords

\(k\)-chromatic number\(k\)-co-independence\(k\)-co-independence partition number\(k\)-independence

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Spectral bounds for the \(k\)-independence number of a graph
• On the \(k\)-independence number of graphs
• Independence and chromatic densities of graphs
• Generalizations of independence and chromatic numbers of a graph
• scientific article; zbMATH DE number 7033848
• On the k-independence number in graphs
• On Selkow's bound on the independence number of graphs
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• A note on the chromatic and independence number of a graph
• Bounding the independence number in some \((n,k,\ell,\lambda)\)-hypergraphs

Cited in

(7)

• Bounds for the chromatic number of graphs with partial information
• Bounds for the matching number, the edge chromatic number and the independence number of a graph in terms of rank
• GENERALISED MAXIMAL INDEPENDENCE AND CLIQUE NUMBERS OF GRAPHS
• Lower bounds on size and independence inK4-free graphs
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• Bounds for the chromatic number of some \(pK_2\)-free graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey

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 Q2936700)