Displaying similar documents to “Families of triples with high minimum degree are hamiltonian”

Strong Chromatic Index Of Planar Graphs With Large Girth

Gerard Jennhwa Chang, Mickael Montassier, Arnaud Pêche, André Raspaud (2014)

Discussiones Mathematicae Graph Theory

Similarity:

Let Δ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree Δ and girth at least 1 Δ+46 is strong (2Δ−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree Δ. This improves [6] when Δ ≥ 6.

On computing quaternion quotient graphs for function fields

Gebhard Böckle, Ralf Butenuth (2012)

Journal de Théorie des Nombres de Bordeaux

Similarity:

Let Λ be a maximal 𝔽 q [ T ] -order in a division quaternion algebra over 𝔽 q ( T ) which is split at the place ∞ . The present article gives an algorithm to compute a fundamental domain for the action of the group of units Λ * on the Bruhat-Tits tree 𝒯 associated to PGL 2 ( 𝔽 q ( ( 1 / T ) ) ) . This action is a function field analog of the action of a co-compact Fuchsian group on the upper half plane. The algorithm also yields an explicit presentation of the group Λ * in terms of generators and relations. Moreover we determine an...