◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Arthur Hoffmann-Ostenhof

10 papers hereh-index 590 citations17 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author6
  • last author2

Across the 10 of 10 papers where every author was matched, so the position is known.

fields
  • math.CO10

identity via Semantic Scholar / OpenAlex

activity
20122017
most citedA note on 5-cycle double covers

10 citations · 14 across the 8 of their papers we have counts for

collaborators
Showing 2017Show all

4 papers · 1 filter

math.CO2017★ 1 cited

Cycle double covers and non-separating cycles

Arthur Hoffmann-Ostenhof, Cun-Quan Zhang, Zhang Zhang

Which 2-regular subgraph R of a cubic graph G can be extended to a cycle double cover of G? We provide a condition which ensures that every R satisfying this condition is…

math.CO2017★ 1 cited

Special Hist-Snarks

Arthur Hoffmann-Ostenhof, Thomas Jatschka

A Hist in a cubic graph G is a spanning tree T which has only vertices of degree three and one. A snark with a Hist is called a Hist-snark, see \cite{HO}. We present several co…

math.CO2017

Snarks with special spanning trees

Arthur Hoffmann-Ostenhof, Thomas Jatschka

Let G be a cubic graph which has a decomposition into a spanning tree T and a 2-regular subgraph C, i.e. E(T)∪E(C)=E(G) and E(T)∩E(C)=∅. We provid…

math.CO2017

Cycle Double Covers via Kotzig Graphs

Herbert Fleischner, Roland Häggkvist, Arthur Hoffmann-Ostenhof

We show that every 2-connected cubic graph G has a cycle double cover if G has a spanning subgraph F such that (i) every component of F has an even number of vertices (ii…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.