The double competition number of some triangle-free graphs

DOI10.1016/0166-218X(90)90007-YMaRDI QIDQ757405zbMATH OpenFDO

Authors Suzanne Seager

Publication date 1990

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

competition graphdigraphtriangle-free competition-common enemy graphs

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 4063115
• The competition-common enemy graph of a digraph
• A generalization of Opsut's lower bounds for the competition number of a graph
• Connected triangle-free \(m\)-step competition graphs
• Competition numbers of graphs with a small number of triangles

Cites work

• scientific article; zbMATH DE number 4063115 (Why is no real title available?)
• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• The competition-common enemy graph of a digraph

Cited in

(11)

• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• On the double competition number
• scientific article; zbMATH DE number 1154594 (Why is no real title available?)
• The Double Multicompetition Number of a Multigraph
• \((i,j)\) competition graphs
• On CCE graphs of doubly partial orders
• \(p\)-competition graphs
• \(p\)-competition numbers
• The \(m\)-step competition graph of a digraph
• scientific article; zbMATH DE number 4063115 (Why is no real title available?)
• The competition-common enemy graph of a digraph

This page was built for publication: The double competition number of some triangle-free graphs

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