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

A new bound on the domination number of graphs with minimum degree two

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

zbMath1209.05171MaRDI QIDQ625374

Michael A. Henning, Anders Yeo, Ingo Schiermeyer

Publication date: 17 February 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/225152


zbMATH Keywords

cyclesboundsdomination number


Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)


Related Items (5)

A characterization of hypergraphs with large domination number ⋮ Paired-Domination Game Played in Graphs ⋮ Domination number of graphs with minimum degree five ⋮ Unnamed Item ⋮ Hypergraphs with large domination number and with edge sizes at least three







This page was built for publication: A new bound on the domination number of graphs with minimum degree two

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