Competition parameters of a graph

MaRDI QIDQ2474667zbMATH OpenFDO

Authors Suk J. Seo, Peter Slater

Publication date 6 March 2008

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

competition parametercompetition-enclaveless parametercompetition-independence parameterscompetition-reachability

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Games involving graphs (91A43)

Recommendations

• Competition graphs and clique dimensions
• scientific article; zbMATH DE number 822733
• scientific article; zbMATH DE number 3912431
• \(p\)-competition graphs
• Characterizations of competition multigraphs
• scientific article; zbMATH DE number 1933246
• \((i,j)\) competition graphs
• Competition-reachability of a graph
• Competition indices of strongly connected digraphs
• Competitively tight graphs

Cited in

(9)

• The competition-independence game in trees
• scientific article; zbMATH DE number 2170474 (Why is no real title available?)
• The graph distance game and some graph operations
• scientific article; zbMATH DE number 1933246 (Why is no real title available?)
• The orthogonal colouring game
• Competition-reachability of a graph
• The enclaveless competition game
• An introduction to competition-directed-cycle numbers of graphs
• An introduction to game domination in graphs

This page was built for publication: Competition parameters of a graph

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