Competition polysemy

DOI10.1016/j.disc.2003.11.014zbMath1042.05068OpenAlexW2913050588WikidataQ29028307 ScholiaQ29028307MaRDI QIDQ1827753

Dieter Rautenbach, Dirk Kremer, Miranca Fischermann, Werner Knoben

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

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

Related Items (1)

Simple ingredients leading to very efficient heuristics for the maximum clique problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A characterization of competition graphs
• A characterization of graphs of competition number m
• A characterization of competition graphs of arbitrary digraphs
• The competition-common enemy graph of a digraph
• Bound graph polysemy
• Topics in Intersection Graph Theory

This page was built for publication: Competition polysemy