The Bar Visibility Number of a Graph

DOI10.1137/S0895480198343455MaRDI QIDQ5317561zbMATH OpenFDO

Authors Yi-Wu Chang, Joan P. Hutchinson, Michael Jacobson, Jeno Lehel, Douglas B. West

Publication date 16 September 2005

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480198343455

zbMATH Keywords

bar visibility graphinterval numberplanar graphsplitting numberthickness

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• On the bar visibility number of complete bipartite graphs
• Bar k-Visibility Graphs
• Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
• Graph Drawing
• Visibility number of directed graphs

Cited in

(14)

• Upper bounds for bar visibility of subgraphs and \(n\)-vertex graphs
• Bar visibility numbers for hypercubes and outerplanar digraphs
• Unit hypercube visibility numbers of trees
• Splits with forbidden subgraphs
• The unit bar visibility number of a graph
• Further Results on Bar k-Visibility Graphs
• Thickness of Bar 1-Visibility Graphs
• On the bar visibility number of complete bipartite graphs
• On bar \((1, j)\)-visibility graphs (extended abstract)
• Bar k-Visibility Graphs
• Sliding column model for t-unit bar visibility representations of graphs
• Some new results on bar visibility of digraphs
• Interview with Douglas West
• Minimum difference representations of graphs

This page was built for publication: The Bar Visibility Number of a Graph

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