Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Edge domatic numbers of complete \(n\)-partite graphs

From MaRDI portal
Publication:1340123
Jump to:navigation, search

DOI10.1007/BF02986672zbMath0819.05036MaRDI QIDQ1340123

Shiow-Fen Hwang, Gerard Jennhwa Chang

Publication date: 11 December 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)


zbMATH Keywords

edge dominating setedge domatic numbercomplete \(n\)-partite graphsedge domatic partition


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)


Related Items (1)

Unnamed Item




Cites Work

  • Unnamed Item
  • Dominating sets and domatic number of circular arc graphs
  • On the domatic number of interval graphs
  • Linear algorithm for domatic number problem on interval graphs
  • Edge-domatic number of a graph
  • Edge Dominating Sets in Graphs
  • The Domatic Number Problem in Interval Graphs




This page was built for publication: Edge domatic numbers of complete \(n\)-partite graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1340123&oldid=13471421"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki