Edge domination in complete partite graphs

DOI10.1016/0012-365X(94)90229-1MaRDI QIDQ1336647zbMATH OpenOpenAlexFDO

Authors Bor-Liang Chen, Hung-Lin Fu

Publication date 8 March 1995

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(94)90229-1

zbMATH Keywords

partitiondominationcomplete multipartite graphsedge dominating setcomplete partite graphscomplete split graphsedge domatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 975334
• Edge-domatic number of a graph
• Edge domination in graphs
• scientific article; zbMATH DE number 90551

Cites work

• scientific article; zbMATH DE number 3674114 (Why is no real title available?)
• Edge Dominating Sets in Graphs
• Edge-domatic number of a graph
• On embedding incomplete symmetric Latin squares
• The edge domination problem

Cited in

(2)

• Maximal matching and edge domination in complete multipartite graphs
• Edge domination on bipartite permutation graphs and cotriangulated graphs

This page was built for publication: Edge domination in complete partite graphs

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