Existence of spanning and dominating trails and circuits

Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. T is a dominating trail (D-trail) if every edge of G is incident with at least one vertex of T. A circuit is a nontrivial closed trail. Sufficient conditions involving lower bounds on the degree-sum of vertices or edges are derived for graphs to have an S-trail, S-circuit, D-trail, or D-circuit. Thereby a result of Brualdi and Shanny and one mentioned by Lesniak-Foster and Williamson are improved

Properties of Catlin's reduced graphs and supereulerian graphs

A graph $G$ is called collapsible if for every even subset $R\subseteq V(G)$, there is a spanning connected subgraph $H$ of $G$ such that $R$ is the set of vertices of odd degree in $H$. A graph is the reduction of $G$ if it is obtained from $G$ by contracting all the nontrivial collapsible subgraphs. A graph is reduced if it has no nontrivial collapsible subgraphs. In this paper, we first prove a few results on the properties of reduced graphs. As an application, for 3-edge-connected graphs $G$ of order $n$ with $d(u)+d(v)\ge 2(n/p-1)$ for any $uv\in E(G)$ where $p>0$ are given, we show how such graphs change if they have no spanning Eulerian subgraphs when $p$ is increased from $p=1$ to 10 then to $15$

Low-distortion embeddings of graphs with large girth

The main purpose of the paper is to construct a sequence of graphs of constant degree with indefinitely growing girths admitting embeddings into $\ell_1$ with uniformly bounded distortions. This result answers the problem posed by N. Linial, A. Magen, and A. Naor (2002).Comment: Some confusing omissions are corrected in the second versio