Rank numbers for bent ladders

DOI10.7151/DMGT.1739MaRDI QIDQ2450128zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 16 May 2014

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1739

zbMATH Keywords

Cartesian product of graphsladder graphrank numbergraph coloringsbent ladder graphrankings of graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Rank numbers of grid graphs
• Rank numbers of graphs that are combinations of paths and cycles
• Rank numbers for some trees and unicyclic graphs
• The birank number of ladder, prism and Möbius ladder graphs
• Ranking numbers of graphs

Cites work

• scientific article; zbMATH DE number 2076918 (Why is no real title available?)
• Minimal \(k\)-rankings and the rank number of \(P^2_n\)
• Minimal \(k\)-rankings for prism graphs
• Minimal rankings
• On a graph partition problem with application to VLSI layout
• On-line ranking number for cycles and paths
• Optimal node ranking of trees
• Ordered colourings
• Rank numbers of grid graphs
• Ranking numbers of graphs
• Rankings of Graphs
• Vertex ranking of asteroidal triple-free graphs

Cited in

(3)

• The birank number of ladder, prism and Möbius ladder graphs
• Rank numbers of grid graphs
• Graphs with large rank numbers and rank numbers of subdivided stars

This page was built for publication: Rank numbers for bent ladders

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