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
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Maximal edge-colorings of graphs

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

DOI10.1007/S00373-017-1797-0zbMath1380.05078OpenAlexW2617199263MaRDI QIDQ1696530

Magdalena Tyniec, Mariusz Meszka

Publication date: 14 February 2018

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1797-0


zbMATH Keywords

edge coloringmaximal configuration


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)


Related Items (1)

Maximal edge colorings of graphs




Cites Work

  • The greedy algorithm is optimal for on-line edge coloring
  • On-line edge-coloring with a fixed number of colors
  • Unnamed Item
  • Unnamed Item




This page was built for publication: Maximal edge-colorings of graphs

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