Edge list multicoloring trees: An extension of Hall's theorem

DOI10.1002/JGT.10093zbMATH Open1011.05023OpenAlexW2605172323MaRDI QIDQ4800403FDOQ4800403

Authors: András Gyárfás, Jeno Lehel, Mathew Cropper 

Publication date: 3 April 2003

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.10093

Recommendations

• scientific article; zbMATH DE number 1161390
• scientific article; zbMATH DE number 1151851
• scientific article; zbMATH DE number 4208092
• scientific article; zbMATH DE number 1735800
• Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs

zbMATH Keywords

proper list coloring

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Transversal (matching) theory (05D15)

Cites Work

• The Marriage Problem
• Title not available (Why is that?)
• Extending an edge-coloring
• Title not available (Why is that?)
• Extending the disjoint-representatives theorems of Hall, Halmos, and Vaughan to list-multicolorings of graphs

Cited In (9)

• A note on total and list edge-colouring of graphs of tree-width 3
• List multicolorings of graphs with measurable sets
• A Hall-type theorem for triplet set systems based on medians in trees
• List edge multicoloring in graphs with few cycles
• List multicoloring problems involving the \(k\)-fold Hall numbers
• Extending Hall's theorem into list colorings: a partial history
• An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree
• Edge precoloring extension of trees
• List colorings with measurable sets

This page was built for publication: Edge list multicoloring trees: An extension of Hall's theorem

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