Some Hamiltonian Properties of One-Conflict Graphs (Q2946062): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-19315-1_23
+Normal rank
@@ Property / OpenAlex ID @@
+W2293125063
@@ Property / OpenAlex ID: W2293125063 / rank @@
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Two-factors in orientated graphs with forbidden transitions
+Normal rank
@@ Property / cites work @@
+An Exact Algorithm to Check the Existence of (Elementary) Paths and a Generalisation of the Cut Problem in Graphs with Forbidden Transitions
+Normal rank
@@ Property / cites work @@
+Trees in Graphs with Conflict Edges or Forbidden Transitions
+Normal rank
@@ Property / cites work @@
+Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
+Normal rank
@@ Property / cites work @@
+Note on Hamilton Circuits
@@ Property / cites work: Note on Hamilton Circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Finding paths in graphs avoiding forbidden transitions
+Normal rank