AbstractWe investigate the existence of subgraphs H of low degree sum wG(H) of their vertices in graphs G of minimum degree 5 on compact 2-manifolds M of Euler characteristic χ(M)≤0. The value wG(H) is said to be the weight of H in G. We prove:(i)If G has more than 83|χ(M)| vertices then G contains a 3-cycle of weight at most 18.(ii)If ∑deg(v)≥7(degG(v)−6)>24|χ(M)| then G contains a 3-cycle of weight at most 18 and a path with three vertices of weight at most 17
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
AbstractA graph H is said to be light in a family H of graphs if each graph G∈H containing a subgrap...
AbstractFor every graph G, let σ2(G)=min{d(x)+d(y):xy∉E(G)}. The main result of the paper says that ...
AbstractWe investigate the existence of subgraphs H of low degree sum wG(H) of their vertices in gra...
AbstractWe have proved that each 3-connected multigraph G without loops and trivial 2-cycles embedde...
AbstractIt is well known that every polyhedral map with large enough number of vertices contains a v...
AbstractLet G(M) be the family of all 3-connected graphs which can be embedded in a compact 2-manifo...
AbstractLet k≥ 2, be an integer and M be a closed two-manifold with Euler characteristic χ(M) ≤ 0. W...
summary:Let $P_k$ be a path on $k$ vertices. In an earlier paper we have proved that each polyhedral...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractWe prove that each polyhedral triangular face free map G on a compact 2-dimensional manifold...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractA graph H is defined to be light in a family H of graphs if there exists a finite number φ(H...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
AbstractA graph H is said to be light in a family H of graphs if each graph G∈H containing a subgrap...
AbstractFor every graph G, let σ2(G)=min{d(x)+d(y):xy∉E(G)}. The main result of the paper says that ...
AbstractWe investigate the existence of subgraphs H of low degree sum wG(H) of their vertices in gra...
AbstractWe have proved that each 3-connected multigraph G without loops and trivial 2-cycles embedde...
AbstractIt is well known that every polyhedral map with large enough number of vertices contains a v...
AbstractLet G(M) be the family of all 3-connected graphs which can be embedded in a compact 2-manifo...
AbstractLet k≥ 2, be an integer and M be a closed two-manifold with Euler characteristic χ(M) ≤ 0. W...
summary:Let $P_k$ be a path on $k$ vertices. In an earlier paper we have proved that each polyhedral...
AbstractGiven a graphG, let ak-trestle ofGbe a 2-connected spanning subgraph ofGof maximum degree at...
AbstractWe prove that each polyhedral triangular face free map G on a compact 2-dimensional manifold...
We study graphs on n vertices which have 2n−2 edges and no proper induced subgraphs of minimum degre...
AbstractThe Euler genus of the surface Σ obtained from the sphere by the addition of k crosscaps and...
AbstractA graph H is defined to be light in a family H of graphs if there exists a finite number φ(H...
AbstractAn Euler characteristic argument indicates that if K, a girth three graph, triangulates the ...
AbstractIn this paper, we prove that there exists a function a:N0×R+→N such that for each ε>0, if G ...
AbstractA graph H is said to be light in a family H of graphs if each graph G∈H containing a subgrap...
AbstractFor every graph G, let σ2(G)=min{d(x)+d(y):xy∉E(G)}. The main result of the paper says that ...