On-line rankings of graphs
From MaRDI portal
Publication:1970586
DOI10.1016/S0012-365X(99)00215-0zbMath0946.05039OpenAlexW2029465292WikidataQ127663158 ScholiaQ127663158MaRDI QIDQ1970586
Zsolt Tuza, Ingo Schiermeyer, Margit Voigt
Publication date: 23 October 2000
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00215-0
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
A lower bound for on-line ranking number of a path ⋮ Online Conflict-Free Colouring for Hypergraphs ⋮ A note on on-line ranking number of graphs