Rank numbers for some trees and unicyclic graphs
From MaRDI portal
Publication:719660
DOI10.1007/S00010-011-0079-9zbMATH Open1232.05210OpenAlexW2052033502MaRDI QIDQ719660FDOQ719660
Authors: D. Kharzeev 
Publication date: 11 October 2011
Published in: Aequationes Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00010-011-0079-9
Recommendations
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Optimal node ranking of trees
- Rankings of Graphs
- Title not available (Why is that?)
- On-line ranking number for cycles and paths
- Ranking numbers of graphs
- On a graph partition problem with application to VLSI layout
- Ordered colourings
- Vertex ranking of asteroidal triple-free graphs
- Minimal rankings
- Rank numbers of grid graphs
- Minimal \(k\)-rankings and the rank number of \(P^2_n\)
- Minimal \(k\)-rankings for prism graphs
Cited In (7)
- Rank numbers for bent ladders
- Rank numbers of grid graphs
- Graphs with large rank numbers and rank numbers of subdivided stars
- On ranking and unranking labeled digraphs
- Title not available (Why is that?)
- \(l_p\)-optimal rankings and max-optimal rankings are different
- Rank numbers of graphs that are combinations of paths and cycles
This page was built for publication: Rank numbers for some trees and unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719660)
