Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph

DOI10.1016/J.ENDM.2006.06.006zbMATH Open1201.05066OpenAlexW2001906404MaRDI QIDQ3439409FDOQ3439409

Authors: V. I. Benediktovich 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.06.006

Recommendations

• Partitions of complete bipartite geometric graphs into plane perfect matchings
• scientific article; zbMATH DE number 1501958
• Partitions of complete geometric graphs into plane trees
• Graph Drawing
• On Subgraphs of the Complete Bipartite Graph
• On the planar subdivision of a drawing of a complete graph in the plane
• On the number of plane geometric graphs
• Plane elementary bipartite graphs
• On plane subgraphs of complete topological drawings
• On plane bipartite graphs without fixed edges

zbMATH Keywords

geometric graphnon-crossing subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Bipartite embeddings of trees in the plane
• Title not available (Why is that?)
• Noncrossing Subgraphs in Topological Layouts
• Graph Drawing

This page was built for publication: Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph

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