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

The rainbow connection problem: mathematical formulations.

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

zbMATH Open1413.05118MaRDI QIDQ2829026FDOQ2829026


Authors: Hakan Kutucu, F. Nuriyeva, O. Ugurlu Edit this on Wikidata


Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)





Recommendations

  • Rainbow connection in graphs
  • On rainbow connection
  • Rainbow connection number and connectivity


zbMATH Keywords

mathematical modelingmixed integer programmingrainbow connectionrainbow vertex-connection


Mathematics Subject Classification ID

Combinatorial optimization (90C27) Mixed integer programming (90C11) Coloring of graphs and hypergraphs (05C15)



Cited In (2)

  • An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
  • The rainbow cycle cover problem

Uses Software

  • KNITRO
  • GAMS





This page was built for publication: The rainbow connection problem: mathematical formulations.

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

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