Some Hamiltonian Properties of One-Conflict Graphs

DOI10.1007/978-3-319-19315-1_23zbMath1401.05174OpenAlexW2293125063MaRDI QIDQ2946062

Benjamin Momège, Christian Laforest

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_23

zbMATH Keywords

graphcycleHamiltonianpathconflict

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Introduction to routing problems with mandatory transitions ⋮ Domination problems with no conflicts ⋮ On the complexity of independent dominating set with obligations in graphs

Cites Work

• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
• Two-factors in orientated graphs with forbidden transitions
• A method in graph theory
• Finding paths in graphs avoiding forbidden transitions
• An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
• Note on Hamilton Circuits
• Trees in Graphs with Conflict Edges or Forbidden Transitions
• Some Theorems on Abstract Graphs

This page was built for publication: Some Hamiltonian Properties of One-Conflict Graphs