The competition hypergraphs of doubly partial orders

DOI10.1016/J.DAM.2012.05.024MaRDI QIDQ2448902zbMATH OpenOpenAlexFDO

Authors Suh-Ryung Kim, Jung Yeun Lee, Boram Park, Yoshio Sano

Publication date 5 May 2014

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

Full work available at URL https://arxiv.org/abs/1111.4375

zbMATH Keywords

competition graphsinterval hypergraphsdoubly partial orderscompetition hypergraphs

Mathematics Subject Classification ID

Hypergraphs (05C65)

Abstract: Since Cho and Kim (2005) showed that the competition graph of a doubly partial order is an interval graph, it has been actively studied whether or not the same phenomenon occurs for other variants of competition graph and interesting results have been obtained. Continuing in the same spirit, we study the competition hypergraph, an interesting variant of the competition graph, of a doubly partial order. Though it turns out that the competition hypergraph of a doubly partial order is not always interval, we completely characterize the competition hypergraphs of doubly partial orders which are interval.

Recommendations

• The \(m\)-step competition graphs of doubly partial orders
• The niche graphs of doubly partial orders
• On the competition graphs of \(d\)-partial orders
• A class of acyclic digraphs with interval competition graphs
• The phylogeny graphs of doubly partial orders

Cites work

• scientific article; zbMATH DE number 5914965 (Why is no real title available?)
• scientific article; zbMATH DE number 434915 (Why is no real title available?)
• scientific article; zbMATH DE number 4149959 (Why is no real title available?)
• scientific article; zbMATH DE number 3912431 (Why is no real title available?)
• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• scientific article; zbMATH DE number 1303533 (Why is no real title available?)
• scientific article; zbMATH DE number 2188417 (Why is no real title available?)
• A class of acyclic digraphs with interval competition graphs
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Competition Graphs of Strongly Connected and Hamiltonian Digraphs
• Competition hypergraphs
• Competition hypergraphs of digraphs with certain properties I. Strong connectedness
• Competition hypergraphs of digraphs with certain properties II. Hamiltonicity
• Competition hypergraphs of products of digraphs
• Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
• Interval competition graphs of symmetric digraphs
• Introduction to graph and hypergraph theory
• Niche graphs
• On CCE graphs of doubly partial orders
• On the hypercompetition numbers of hypergraphs.
• The \(m\)-step competition graph of a digraph
• The \(m\)-step competition graphs of doubly partial orders
• The competition-common enemy graph of a digraph
• The competition-common enemy graphs of digraphs satisfying Conditions $C(p)$ and $C'(p)$
• The domination and competition graphs of a tournament
• The niche graphs of doubly partial orders
• The phylogeny graphs of doubly partial orders
• Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two

Cited in

(11)

• On the partial order competition dimensions of chordal graphs
• On the competition graphs of \(d\)-partial orders
• On the hypercompetition numbers of hypergraphs with maximum degree at most two
• A graph with the partial order competition dimension greater than five
• The phylogeny graphs of doubly partial orders
• scientific article; zbMATH DE number 1154594 (Why is no real title available?)
• The \(m\)-step competition graphs of doubly partial orders
• Niche hypergraphs
• Competition hypergraphs of products of digraphs
• The niche graphs of doubly partial orders
• The partial order competition dimensions of bipartite graphs

This page was built for publication: The competition hypergraphs of doubly partial orders

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