Premium
A class of upper‐embeddable graphs
Author(s) -
Jaeger F.,
Payan C.,
Xuong N. H.
Publication year - 1979
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.3190030409
Subject(s) - combinatorics , mathematics , disjoint sets , vertex (graph theory) , discrete mathematics , graph , upper and lower bounds , cograph , chordal graph , 1 planar graph , mathematical analysis
In this paper, we prove the following result: Every graph obtained by connecting (with any number of edges) two vertex‐disjoint upper‐embeddable graphs graphs with even Betti number is upper‐embeddable.