A clique-difference encoding scheme for labelled \(k\)-path graphs (Q1003468): 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.dam.2008.05.015
+Normal rank
@@ Property / OpenAlex ID @@
+W2154391310
@@ Property / OpenAlex ID: W2154391310 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5607734
@@ Property / cites work: Q5607734 / rank @@
+Normal rank
@@ Property / cites work @@
+A coding algorithm for Rényi trees
@@ Property / cites work: A coding algorithm for Rényi trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4329049
@@ Property / cites work: Q4329049 / rank @@
+Normal rank
@@ Property / cites work @@
+The Reduced Prüfer Code for Rooted Labelled k-Trees
+Normal rank
@@ Property / cites work @@
+Properties and characterizations of             <i>k</i>             ‐trees
+Normal rank
@@ Property / cites work @@
+Subclasses of \(k\)-trees: characterization and recognition
+Normal rank
@@ Property / cites work @@
+Q4288578
@@ Property / cites work: Q4288578 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Classes: A Survey
@@ Property / cites work: Graph Classes: A Survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q4947393
@@ Property / cites work: Q4947393 / rank @@
+Normal rank
@@ Property / cites work @@
+Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
+Normal rank