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

Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types

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

zbMath1025.05023MaRDI QIDQ1411559

Vitaly I. Voloshin, Zsolt Tuza

Publication date: 29 October 2003

Published in: Computer Science Journal of Moldova (Search for Journal in Brave)


zbMATH Keywords

mixed hypergraphshypergraph coloring


Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (1)

Color-bounded hypergraphs. I: General results







This page was built for publication: Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types

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