On the trees whose 2-step competition numbers are two.

MaRDI QIDQ3408840zbMATH OpenFDO

Authors Han Hyuk Cho, Suh-Ryung Kim, Yunsun Nam

Publication date 15 November 2006

zbMATH Keywords

2-step competition graphtreestriangle-free graphs

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Two-step graphs of trees
• The (1,2)-step competition graph of a tournament
• scientific article; zbMATH DE number 1161337
• Connected triangle-free \(m\)-step competition graphs
• scientific article; zbMATH DE number 6277695

Cited in

(5)

• Connected triangle-free \(m\)-step competition graphs
• The \(m\)-step, same-step, and any-step competition graphs
• scientific article; zbMATH DE number 1558366 (Why is no real title available?)
• Two-step graphs of trees
• Characterizing paths as \(m\)-step competition graphs

This page was built for publication: On the trees whose 2-step competition numbers are two.

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