Characterization of forbidden subgraphs for the existence of even factors in a graph (Q2030443): Difference between revisions

@@ Property / author @@
-Limning Xiong
@@ Property / author: Limning Xiong / rank @@
-Normal rank
@@ Property / author @@
+Limning Xiong
@@ Property / author: Limning Xiong / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2017.02.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2593770371
@@ Property / OpenAlex ID: W2593770371 / rank @@
+Normal rank
@@ Property / cites work @@
+Forbidden subgraphs and the existence of a 2-factor
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing forbidden pairs for hamiltonian properties
+Normal rank
@@ Property / cites work @@
+The upper bound of the number of cycles in a 2-factor of a line graph
+Normal rank
@@ Property / cites work @@
+Supereulerian graphs and excluded induced minors
@@ Property / cites work: Supereulerian graphs and excluded induced minors / 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 @@
+The existence of even factors in iterated line graphs
+Normal rank
@@ Property / cites work @@
+-factors with the bounded number of components in line graphs
+Normal rank
@@ Property / cites work @@
+The Hamiltonian index of a graph and its branch-bonds
+Normal rank