Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two

DOI10.1016/j.aml.2008.06.046zbMath1185.05120OpenAlexW2061313810MaRDI QIDQ1023063

Yaokun Wu, Junjie Lu

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

zbMATH Keywords

double competition graphminimal forbidden subgraphposet of dimension at most two

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (9)

On the competition graphs of \(d\)-partial orders ⋮ Niche hypergraphs ⋮ The \(m\)-step competition graphs of doubly partial orders ⋮ The partial order competition dimensions of bipartite graphs ⋮ The competition hypergraphs of doubly partial orders ⋮ The double competition hypergraph of a digraph ⋮ A graph with the partial order competition dimension greater than five ⋮ Dimension-2 poset competition numbers and dimension-2 poset double competition numbers ⋮ On the partial order competition dimensions of chordal graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On CCE graphs of doubly partial orders
• The competition-common enemy graph of a digraph
• On the Ferrers dimension of a digraph
• A characteristic property of labelings and linear extensions of posets of dimension 2
• On the double competition number
• Representation of a finite graph by a set of intervals on the real line
• Competition graphs and clique dimensions
• Tolerance graphs, and orders
• Graph Classes: A Survey

This page was built for publication: Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two