Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
From MaRDI portal
Publication:1023063
DOI10.1016/J.AML.2008.06.046zbMATH Open1185.05120OpenAlexW2061313810MaRDI QIDQ1023063FDOQ1023063
Publication date: 10 June 2009
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2008.06.046
Recommendations
Cites Work
- Graph Classes: A Survey
- Title not available (Why is that?)
- On CCE graphs of doubly partial orders
- Representation of a finite graph by a set of intervals on the real line
- The competition-common enemy graph of a digraph
- On the Ferrers dimension of a digraph
- Title not available (Why is that?)
- Tolerance graphs, and orders
- On the double competition number
- Competition graphs and clique dimensions
- A characteristic property of labelings and linear extensions of posets of dimension 2
Cited In (9)
- On the partial order competition dimensions of chordal graphs
- On the competition graphs of \(d\)-partial orders
- A graph with the partial order competition dimension greater than five
- Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
- The \(m\)-step competition graphs of doubly partial orders
- The competition hypergraphs of doubly partial orders
- Niche hypergraphs
- The double competition hypergraph of a digraph
- The partial order competition dimensions of bipartite graphs
This page was built for publication: Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1023063)