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

List edge multicoloring in graphs with few cycles

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

DOI10.1016/J.IPL.2003.09.016zbMath1183.68433OpenAlexW2148239618MaRDI QIDQ1029053

Dániel Marx

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.09.016


zbMATH Keywords

edge coloringgraph algorithmsmulticoloringlist coloring


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)


Related Items (2)

Walking through waypoints ⋮ Subgraph isomorphism on graph classes that exclude a substructure




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • The complexity of completing partial Latin squares
  • Matching theory
  • Matching is as easy as matrix inversion
  • Extending an edge-coloring
  • Graph colorings with local constraints -- a survey
  • An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs




This page was built for publication: List edge multicoloring in graphs with few cycles

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1029053&oldid=13031806"
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 22:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki