Circuits through prescribed edges

Link:
Autor/in:
Erscheinungsjahr:
2020
Medientyp:
Text
Schlagworte:
  • Claw-free Graphs
  • Degree Sum
  • Hamiltonicity
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
  • Claw-free Graphs
  • Degree Sum
  • Hamiltonicity
  • Graph In Graph Theory
  • Coloring
  • Graphic Methods
Beschreibung:
  • We prove that a connected graph 𝐺 contains a circuit—a closed walk that repeats no edges—through any 𝑘 prescribed edges if and only if 𝐺 contains no odd cut of size at most 𝑘.
Lizenz:
  • info:eu-repo/semantics/openAccess
Quellsystem:
Forschungsinformationssystem der UHH
Interne Metadaten
Quelldatensatz
oai:www.edit.fis.uni-hamburg.de:publications/19c5f5eb-97fc-41a2-bee2-e7331052946f