Rank numbers for bent ladders

DOI10.7151/dmgt.1739zbMath1290.05127OpenAlexW1965008988MaRDI QIDQ2450128

Yanyan Li

Publication date: 16 May 2014

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

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 labelling (graceful graphs, bandwidth, etc.) (05C78) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Graphs with large rank numbers and rank numbers of subdivided stars

Cites Work

• Unnamed Item
• Vertex ranking of asteroidal triple-free graphs
• Rank numbers of grid graphs
• Ranking numbers of graphs
• Minimal \(k\)-rankings and the rank number of \(P^2_n\)
• Minimal \(k\)-rankings for prism graphs
• Optimal node ranking of trees
• On a graph partition problem with application to VLSI layout
• Ordered colourings
• Rankings of Graphs
• On-line ranking number for cycles and paths
• Minimal rankings

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