Fraternal Augmentations of graphs, Coloration and Minors (Q3439588): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2007.01.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2049202008
@@ Property / OpenAlex ID: W2049202008 / rank @@
+Normal rank
@@ Property / cites work @@
+Excluding any graph as a minor allows a low tree-width 2-coloring
+Normal rank
@@ Property / cites work @@
+Universal \(H\)-colorable graphs without a given configuration
+Normal rank
@@ Property / cites work @@
+Universality of \(A\)-mote graphs
@@ Property / cites work: Universality of \(A\)-mote graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time low tree-width partitions and algorithmic consequences
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Graph minors. XVI: Excluding a non-planar graph
@@ Property / cites work: Graph minors. XVI: Excluding a non-planar graph / rank @@
+Normal rank