Competition polysemy

DOI10.1016/J.DISC.2003.11.014MaRDI QIDQ1827753zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach

Publication date 6 August 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2003.11.014

zbMATH Keywords

CliqueCompetition graphCommon enemy graphPolysemic pair

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75)

Recommendations

• On competition polysemy and \(m\)-competition polysemy.
• 2-Competition Graphs
• Characterizations of competition multigraphs
• scientific article; zbMATH DE number 6009
• The double competition multigraph of a digraph

Cites work

• scientific article; zbMATH DE number 3831999 (Why is no real title available?)
• scientific article; zbMATH DE number 4095502 (Why is no real title available?)
• scientific article; zbMATH DE number 3606214 (Why is no real title available?)
• scientific article; zbMATH DE number 830463 (Why is no real title available?)
• A characterization of competition graphs
• A characterization of competition graphs of arbitrary digraphs
• A characterization of graphs of competition number m
• Bound graph polysemy
• The competition-common enemy graph of a digraph
• Topics in Intersection Graph Theory

Cited in

(4)

• On competition polysemy and \(m\)-competition polysemy.
• Buridanic competition
• The solution of two problems on bound polysemy
• Simple ingredients leading to very efficient heuristics for the maximum clique problem

This page was built for publication: Competition polysemy

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