Domination in colored complete graphs

DOI10.1002/JGT.3190130607MaRDI QIDQ3490038zbMATH OpenOpenAlexFDO

Authors Ralph Faudree, András Gyárfás, R. H. Schelp, P. Erdős

Publication date 1989

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190130607

zbMATH Keywords

dominating setr-domination

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• A Conjecture of Erdos
• A Solution to the 2/3 Conjecture
• A new bound for the 2/3 conjecture
• Covering 2‐colored complete digraphs by monochromatic d d‐dominating digraphs
• The domination number of the graph defined by two levels of the \(n\)-cube. II

Cited in

(10)

• Size of monochromatic double stars in edge colorings
• Improved monochromatic double stars in edge colorings
• The domination number of the graph defined by two levels of the \(n\)-cube. II
• On some domination colorings of graphs
• Ramsey-type results for Gallai colorings
• Domination in transitive colorings of tournaments
• A Conjecture of Erdos
• Gallai colorings and domination in multipartite digraphs
• A new bound for the 2/3 conjecture
• Covering 2‐colored complete digraphs by monochromatic d d‐dominating digraphs

This page was built for publication: Domination in colored complete graphs

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