Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00224-012-9410-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2057972598
@@ Property / OpenAlex ID: W2057972598 / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum number of perfect matchings in graphs with a given degree sequence
+Normal rank
@@ Property / cites work @@
+Perfect matchings in \(\varepsilon\)-regular graphs
+Normal rank
@@ Property / cites work @@
+-coloring in time
@@ Property / cites work: 3-coloring in time / rank @@
+Normal rank
@@ Property / cites work @@
+Enumerating the edge-colourings and total colourings of a regular graph
+Normal rank
@@ Property / cites work @@
+Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
+Normal rank
@@ Property / cites work @@
+Q4044717
@@ Property / cites work: Q4044717 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768314
@@ Property / cites work: Q2768314 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter complexity of \(\lambda\)-labelings
+Normal rank
@@ Property / cites work @@
+Improved Exact Algorithms for Counting 3- and 4-Colorings
+Normal rank
@@ Property / cites work @@
+On two techniques of combining branching and treewidth
+Normal rank
@@ Property / cites work @@
+Q3396567
@@ Property / cites work: Q3396567 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial bounds via measure and conquer
@@ Property / cites work: Combinatorial bounds via measure and conquer / rank @@
+Normal rank
@@ Property / cites work @@
+Pathwidth of cubic graphs and exact algorithms
@@ Property / cites work: Pathwidth of cubic graphs and exact algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Exact exponential algorithms.
@@ Property / cites work: Exact exponential algorithms. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On independent sets and bicliques in graphs
@@ Property / cites work: On independent sets and bicliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
+Normal rank
@@ Property / cites work @@
+Exact algorithms for \(L(2,1)\)-labeling of graphs
+Normal rank
@@ Property / cites work @@
+The NP-Completeness of Edge-Coloring
@@ Property / cites work: The NP-Completeness of Edge-Coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Exact Algorithm for L(2,1)-Labeling of Graphs
+Normal rank
@@ Property / cites work @@
+On Improved Exact Algorithms for L(2,1)-Labeling of Graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of exact algorithm for \(L(2,1)\)-labeling of graphs
+Normal rank
@@ Property / cites work @@
+Treewidth. Computations and approximations
@@ Property / cites work: Treewidth. Computations and approximations / rank @@
+Normal rank
@@ Property / cites work @@
+Improved edge-coloring with three colors
@@ Property / cites work: Improved edge-coloring with three colors / rank @@
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the channel assignment problem
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the total coloring of certain graphs
@@ Property / cites work: On the total coloring of certain graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Determining the total colouring number is NP-hard
@@ Property / cites work: Determining the total colouring number is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of 3-edge colorings of cubic graphs
@@ Property / cites work: On the number of 3-edge colorings of cubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4414647
@@ Property / cites work: Q4414647 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Coloring Partialk-Trees
@@ Property / cites work: Edge-Coloring Partialk-Trees / rank @@
+Normal rank