Parameterized edge Hamiltonicity (Q2413968): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+Parameterized Edge Hamiltonicity
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6479943
@@ Property / title @@
+Parameterized Edge Hamiltonicity (English)
@@ Property / title: Parameterized Edge Hamiltonicity (English) / rank @@
+Normal rank
@@ Property / zbMATH Open document ID @@
+.05115
@@ Property / zbMATH Open document ID: 1417.05115 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-319-12340-0_29
@@ Property / DOI: 10.1007/978-3-319-12340-0_29 / rank @@
+Normal rank
@@ Property / published in @@
+Graph-Theoretic Concepts in Computer Science
@@ Property / published in: Graph-Theoretic Concepts in Computer Science / rank @@
+Normal rank
@@ Property / publication date @@
+September 2015Timestamp +2015-09-09T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2015-09-09T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 9 September 2015 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q17
@@ Property / Mathematics Subject Classification ID: 68Q17 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6479943
@@ Property / zbMATH DE Number: 6479943 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2614881414
@@ Property / OpenAlex ID: W2614881414 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1534476578
@@ Property / OpenAlex ID: W1534476578 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2041
@@ Property / arXiv ID: 1403.2041 / rank @@
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete
@@ Property / cites work: The edge Hamiltonian path problem is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+A $c^k n$ 5-Approximation Algorithm for Treewidth
@@ Property / cites work: A $c^k n$ 5-Approximation Algorithm for Treewidth / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian line graphs
@@ Property / cites work: Hamiltonian line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Supereulerian graphs: A survey
@@ Property / cites work: Supereulerian graphs: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+On Hamiltonian Line-Graphs
@@ Property / cites work: On Hamiltonian Line-Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
+Normal rank
@@ Property / cites work @@
+On hamiltonian line graphs
@@ Property / cites work: On hamiltonian line graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Relationship Between Clique-Width and Treewidth
+Normal rank
@@ Property / cites work @@
+The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
+Normal rank
@@ Property / cites work @@
+Q3077955
@@ Property / cites work: Q3077955 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time solvable optimization problems on graphs of bounded clique-width
+Normal rank
@@ Property / cites work @@
+UNO is hard, even for a single player
@@ Property / cites work: UNO is hard, even for a single player / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448752
@@ Property / cites work: Q4448752 / rank @@
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4633895
@@ Property / cites work: Q4633895 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2766682
@@ Property / cites work: Q2766682 / rank @@
+Normal rank
@@ Property / cites work @@
+Line graphs of bounded clique-width
@@ Property / cites work: Line graphs of bounded clique-width / rank @@
+Normal rank
@@ Property / cites work @@
+On Eulerian and Hamiltonian Graphs and Line Graphs
+Normal rank
@@ Property / cites work @@
+Eulerian subgraphs containing given vertices and hamiltonian line graphs
+Normal rank
@@ Property / cites work @@
+The edge Hamiltonian path problem is NP-complete for bipartite graphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating clique-width and branch-width
@@ Property / cites work: Approximating clique-width and branch-width / rank @@
+Normal rank
@@ Property / cites work @@
+Cliquewidth and Knowledge Compilation
@@ Property / cites work: Cliquewidth and Knowledge Compilation / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian index is NP-complete
@@ Property / cites work: Hamiltonian index is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+The Graph Motif Problem Parameterized by the Structure of the Input Graph
+Normal rank
@@ Property / cites work @@
+Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+A Dynamic Programming Approach to Sequencing Problems
+Normal rank
@@ Property / cites work @@
+The Spatial Complexity of Oblivious <i>k</i>-Probe Hash Functions
+Normal rank