Some Algorithms on Conditionally Critical Indecomposable Graphs (Q3439358): Difference between revisions

@@ 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.endm.2005.06.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2088816816
@@ Property / OpenAlex ID: W2088816816 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2747613
@@ Property / cites work: Q2747613 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281647
@@ Property / cites work: Q4281647 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing and Combinatorics
@@ Property / cites work: Computing and Combinatorics / rank @@
+Normal rank
@@ Property / cites work @@
+Indecomposable graphs
@@ Property / cites work: Indecomposable graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
+Normal rank
@@ Property / cites work @@
+\(P_ 4\)-trees and substitution decomposition
@@ Property / cites work: \(P_ 4\)-trees and substitution decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Q4218428
@@ Property / cites work: Q4218428 / rank @@
+Normal rank