Competition polysemy

DOI10.1016/J.DISC.2003.11.014zbMATH Open1042.05068DBLPjournals/dm/FischermannKKR04OpenAlexW2913050588WikidataQ29028307 ScholiaQ29028307MaRDI QIDQ1827753FDOQ1827753

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

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

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)

Cites Work

• Title not available (Why is that?)
• Topics in Intersection Graph Theory
• A characterization of competition graphs
• Title not available (Why is that?)
• The competition-common enemy graph of a digraph
• Title not available (Why is that?)
• A characterization of graphs of competition number m
• A characterization of competition graphs of arbitrary digraphs
• Bound graph polysemy
• Title not available (Why is that?)

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)