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

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

Latest revision as of 16:33, 6 July 2024

scientific article
Language Label Description Also known as
English
Colorings with few colors: counting, enumeration and combinatorial bounds
scientific article

    Statements

    Colorings with few colors: counting, enumeration and combinatorial bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 August 2013
    0 references
    exact exponential time algorithms
    0 references
    enumeration
    0 references
    counting
    0 references
    coloring
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers