On the double competition number
From MaRDI portal
Publication:1383383
DOI10.1016/S0166-218X(97)00117-0zbMATH Open0903.05031OpenAlexW2019846313MaRDI QIDQ1383383FDOQ1383383
Authors: Zoltán Füredi 
Publication date: 13 April 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Recommendations
- scientific article; zbMATH DE number 1154594
- scientific article; zbMATH DE number 24419
- The Double Multicompetition Number of a Multigraph
- scientific article; zbMATH DE number 4063115
- \(p\)-competition numbers
- scientific article; zbMATH DE number 3146118
- The double competition number of some triangle-free graphs
- Publication:3474667
- The double competition multigraph of a digraph
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Representation of a Graph by Set Intersections
- Covering the edges of a random graph by cliques
- Clique coverings of the edges of a random graph
- Competition graphs and clique dimensions
Cited In (6)
- \(p\)-competition numbers
- Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- On \(1\,0\,1\)-clear \((0,1)\) matrices and the double competition number of bipartite graphs
- Competition graphs and clique dimensions
- On the inequality \(dk(G)\leq k(G)+1\)
This page was built for publication: On the double competition number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383383)
