Coloring drawings of bipartite graphs: A problem in automated assembly

DOI10.1016/0166-218X(93)90244-IMaRDI QIDQ1208463zbMATH OpenFDO

Authors Frank William Sinden

Publication date 16 May 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

edge coloringscomplete bipartite graphcolorable drawingrectilinear plane drawings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Drawing Colored Graphs on Colored Points
• Drawing graphs in two layers
• Colorability in Orthogonal Graph Drawing
• Two-layer drawings of bipartite graphs
• On drawing regular bipartite graphs

Cites work

• scientific article; zbMATH DE number 3503275 (Why is no real title available?)
• scientific article; zbMATH DE number 3443668 (Why is no real title available?)
• scientific article; zbMATH DE number 3306563 (Why is no real title available?)
• Crossing Number Problems
• On a problem of P. Erdös

Cited in

(1)

• Coloring drawings of graphs

This page was built for publication: Coloring drawings of bipartite graphs: A problem in automated assembly

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