On the p-Edge Clique over Nuber of Complete Bipartite Graphs

DOI10.1137/0405043MaRDI QIDQ4030192zbMATH OpenOpenAlexFDO

Authors Michael Jacobson

Publication date 1 April 1993

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0405043

zbMATH Keywords

digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35)

Recommendations

• 2-Competition Graphs
• Note on \(p\)-competition graphs and paths
• \(p\)-competition graphs
• scientific article; zbMATH DE number 1247730
• p-competition numbers

Cited in

(4)

• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• Tolerance competition graphs
• \(p\)-competition graphs
• 2-Competition Graphs

This page was built for publication: On the p-Edge Clique over Nuber of Complete Bipartite Graphs

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