A Conjecture of Erdos

DOI10.2307/3109808zbMATH Open0914.05039OpenAlexW2330692299WikidataQ123266096 ScholiaQ123266096MaRDI QIDQ4222467FDOQ4222467

Authors: Ralph Faudree 

Publication date: 7 December 1998

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3109808

Recommendations

• Domination in colored complete graphs
• A Solution to the 2/3 Conjecture
• A new bound for the 2/3 conjecture
• scientific article; zbMATH DE number 4154488
• Vertex coverings by monochromatic cycles and trees

zbMATH Keywords

conjecture of Erdősmonochromatic domination

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (5)

• Covering 2‐colored complete digraphs by monochromatic d $d$‐dominating digraphs
• Title not available (Why is that?)
• An Erdős-Gallai conjecture
• Domination in colored complete graphs
• Near-domination in graphs

This page was built for publication: A Conjecture of Erdos

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