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

The Black-and-White Coloring Problem on Trees

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

DOI10.7155/jgaa.00180zbMath1188.05146OpenAlexW2100543938MaRDI QIDQ3184607

Daniel Berend, Shira Zucker

Publication date: 21 October 2009

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00180


zbMATH Keywords

algorithmtreespartial vertex-coloringblack-and-white coloring problem


Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (3)

Tabu search for the BWC problem ⋮ On the complexity of the black-and-white coloring problem on some classes of perfect graphs ⋮ Anticoloring of the rook's graph




This page was built for publication: The Black-and-White Coloring Problem on Trees

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