Coloring \((4K_1,C_4,C_6)\)-free graphs (Q6091816): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2022.113225
@@ Property / DOI: 10.1016/j.disc.2022.113225 / rank @@
-Normal rank
@@ Property / cites work @@
+Clique‐cutsets beyond chordal graphs
@@ Property / cites work: Clique‐cutsets beyond chordal graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Structure and algorithms for (cap, even hole)-free graphs
+Normal rank
@@ Property / cites work @@
+A faster algorithm to recognize even-hole-free graphs
+Normal rank
@@ Property / cites work @@
+Recognizing Berge graphs
@@ Property / cites work: Recognizing Berge graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The strong perfect graph theorem
@@ Property / cites work: The strong perfect graph theorem / rank @@
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs part I: Decomposition theorem
+Normal rank
@@ Property / cites work @@
+Even-hole-free graphs part II: Recognition algorithm
+Normal rank
@@ Property / cites work @@
+Triangulated neighborhoods in even-hole-free graphs
+Normal rank
@@ Property / cites work @@
+Decomposition of even-hole-free graphs with star cutsets and 2-joins
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On diameters and radii of bridged graphs
@@ Property / cites work: On diameters and radii of bridged graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection of two vertex coloring problems
@@ Property / cites work: The intersection of two vertex coloring problems / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-width III
@@ Property / cites work: Clique-width III / rank @@
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+On simplicial and co-simplicial vertices in graphs.
+Normal rank
@@ Property / cites work @@
+A note on coloring \((4K_1, C_4, C_6)\)-free graphs with a \(C_7\)
+Normal rank
@@ Property / cites work @@
+Coloring rings
@@ Property / cites work: Coloring rings / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithm Theory - SWAT 2004
@@ Property / cites work: Algorithm Theory - SWAT 2004 / rank @@
+Normal rank
@@ Property / cites work @@
+On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
+Normal rank
@@ Property / cites work @@
+MSOL partitioning problems on graphs of bounded treewidth and clique-width
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Efficient graph representations
@@ Property / cites work: Efficient graph representations / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Generating All the Maximal Independent Sets
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2022.113225
@@ Property / DOI: 10.1016/J.DISC.2022.113225 / rank @@
+Normal rank