Rank numbers for bent ladders

DOI10.7151/DMGT.1739zbMATH Open1290.05127OpenAlexW1965008988MaRDI QIDQ2450128FDOQ2450128

Authors: 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

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

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)

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 (3)

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

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)