EuDML | Browse

For an end $τ$ and a tree $T$ of a graph $G$ we denote respectively by $m (τ)$ and $m_{T} (τ)$ the maximum numbers of pairwise disjoint rays of $G$ and $T$ belonging to $τ$ , and we define $t m (τ) : = min {m_{T} (τ) T is a spanning tree of G}$ . In this paper we give partial answers—affirmative and negative ones—to the general problem of determining if, for a function $f$ mapping every end $τ$ of $G$ to a cardinal $f (τ)$ such that $t m (τ) \leq f (τ) \leq m (τ)$ , there exists a spanning tree $T$ of $G$ such that $m_{T} (τ) = f (τ)$ for every end $τ$ of $G$ .

Currently displaying 261 – 280 of 585

Previous Page 14 Next

Displaying 261 – 280 of 585

Lokální vlastnosti grafů

Lower bound for the norm of a vertex-transitive graph.

Matchings in hexagonal cacti.

Matchings in infinite graphs

Matroidal decomposition of a graph

Maximal Graphs with Given Connectivity and Edge-Connectivity

Median graphs

Meromorphisms of graphs

Minimal Isthmoids.

Minimum functors on categories of Neumann trees

Model-interpretability into trees and applications.

Multi-faithful spanning trees of infinite graphs

Multi-polarized graphs

Neighborhoods in line graphs

Neighbourhood realizations of complements of intersection graphs

Non-constant continuous mappings of metric or compact Hausdorff spaces

Note on homomorphism interpolation theorem

Note on Induced Subgraphs of the Unit Distance Graph En.

Note on the number of monoids of order $n$

Note sur le théorème des demi-degrés

Currently displaying 261 – 280 of 585