Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graph coloring applications and defining sets in graph theory

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

zbMATH Open1378.05001MaRDI QIDQ4601036FDOQ4601036


Authors: Masoumeh Ahadi Moghaddam Edit this on Wikidata


Publication date: 18 January 2018


Full work available at URL: http://d-nb.info/1127044435/34




Recommendations

  • Defining sets and uniqueness in graph colorings: A survey
  • The defining numbers for vertex colorings of certain graphs
  • On the computational complexity of defining sets
  • scientific article; zbMATH DE number 863472
  • On the defining number for vertex colorings of a family of graphs


Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)



Cited In (5)

  • Defining sets and uniqueness in graph colorings: A survey
  • On the computational complexity of defining sets
  • On the extending ofk-regular graphs and their strong defining spectrum
  • Defining sets in vertex colorings of graphs and latin rectangles
  • Coloration de graphes : fondements et applications





This page was built for publication: Graph coloring applications and defining sets in graph theory

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4601036&oldid=18759531"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 7 February 2024, at 13:35. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki