z-logo
Premium
Quadrilateral embeddings of bipartite graphs
Author(s) -
Anderson Ian
Publication year - 1981
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190050404
Subject(s) - quadrilateral , bipartite graph , combinatorics , mathematics , complete bipartite graph , discrete mathematics , embedding , 1 planar graph , chordal graph , graph , computer science , physics , finite element method , artificial intelligence , thermodynamics
Current graphs and a theorem of White are used to show the existence of almost complete regular bipartite graphs with quadrilateral embeddings conjectured by Pisanski. Decompositions of K n and K n, n into graphs with quadrilateral embeddings are discussed, and some thickness results are obtained. Some new genus results are also obtained.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here