Max-optimal and sum-optimal labelings of graphs
From MaRDI portal
Publication:763483
DOI10.1016/J.IPL.2011.09.006zbMATH Open1232.05080OpenAlexW2028918432MaRDI QIDQ763483FDOQ763483
Robert E. Jamison, Darren Narayan
Publication date: 9 March 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.09.006
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Rankings of Graphs
- Title not available (Why is that?)
- Greedy rankings and arank numbers
- Title not available (Why is that?)
- On a graph partition problem with application to VLSI layout
- On chromatic sums and distributed resource allocation
- Vertex ranking of asteroidal triple-free graphs
- On sum coloring of graphs
- On vertex ranking of a starlike graph
- Minimal rankings and the arank number of a path
- Further results on minimal rankings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Minimal rankings
- Minimal \(k\)-rankings and the rank number of \(P^2_n\)
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Max-optimal and sum-optimal labelings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q763483)