Coloring drawings of bipartite graphs: A problem in automated assembly

DOI10.1016/0166-218X(93)90244-IzbMATH Open0771.05040MaRDI QIDQ1208463FDOQ1208463

Authors: Frank William Sinden 

Publication date: 16 May 1993

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

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

zbMATH Keywords

edge coloringscomplete bipartite graphcolorable drawingrectilinear plane drawings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Crossing Number Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)