Independence number of 2-factor-plus-triangles graphs

zbMATH Open1178.05070MaRDI QIDQ1010933FDOQ1010933

Authors: Jennifer Vandenbussche, Douglas B. West 

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117306

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• An algorithm for identifying cycle-plus-triangles graphs
• On the tightness of the \(\frac {5}{14}\) independence ratio
• scientific article; zbMATH DE number 1151823
• Triangle-free planar graphs with the smallest independence number
• 11/30 (Finding large independent sets in connected triangle-free 3- regular graphs)

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (2)

• A note on the independence number of triangle-free graphs. II
• Cooperative colorings and independent systems of representatives

This page was built for publication: Independence number of 2-factor-plus-triangles graphs

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