The double competition number of some triangle-free graphs

DOI10.1016/0166-218X(90)90007-YzbMATH Open0723.05063MaRDI QIDQ757405FDOQ757405

Authors: Suzanne Seager 

Publication date: 1990

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

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

zbMATH Keywords

competition graphdigraphtriangle-free competition-common enemy graphs

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The competition-common enemy graph of a digraph
• Title not available (Why is that?)

Cited In (11)

• \(p\)-competition numbers
• On the double competition number
• On CCE graphs of doubly partial orders
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• The Double Multicompetition Number of a Multigraph
• Title not available (Why is that?)
• \((i,j)\) competition graphs
• The competition-common enemy graph of a digraph
• The \(m\)-step competition graph of a digraph
• \(p\)-competition graphs
• Title not available (Why is that?)

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)