scientific article; zbMATH DE number 5671263

MaRDI QIDQ3405211zbMATH OpenFDO

Authors Chunxiang Wang

Publication date 12 February 2010

zbMATH Keywords

colouringcubic graphdomination numberindependence number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Maximizing the number of independent sets in claw-free cubic graphs
• Independence complexes of claw-free graphs
• Counting independent sets in claw-free graphs
• Independence number of graphs with a prescribed number of cliques
• Independence and upper irredundance in claw-free graphs
• The roots of the independence polynomial of a clawfree graph
• On the numbers of independent k-sets in a claw free graph
• Counting Claw-Free Cubic Graphs
• On the independence number of traceable 2-connected claw-free graphs
• The independence number of circulant triangle-free graphs

Cited in

(4)

• Independence and upper irredundance in claw-free graphs
• Counting labeled claw-free cubic graphs by connectivity
• Maximizing the number of independent sets in claw-free cubic graphs
• Gated independence in graphs

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