Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds (Q3057611): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1579538307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-coloring in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluation of permanents in rings and semirings / 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: 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / 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: Exact Algorithms for L(2,1)-Labeling of Graphs / 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: Edge-Coloring Partialk-Trees / rank
 
Normal rank

Latest revision as of 12:06, 3 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
    16 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references