The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (Q3057634): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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_28 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1571652254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4830805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum size of 3-uniform hypergraphs not containing a Fano plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of colouring problems on dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Timetable and Multicommodity Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Perfect Matching Problems on Dense Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of the Hamiltonian Cycle Problem in Dense Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expected polynomial time algorithm for coloring 2-colorable 3-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings and \(K_4^3\)-tilings in hypergraphs of large codegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dirac-Type Theorem for 3-Uniform Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in large uniform hypergraphs with large minimum collective degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Almost Perfect Matchings in Uniform Hypergraphs with High Codegree / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:07, 3 July 2024

scientific article
Language Label Description Also known as
English
The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree
scientific article

    Statements

    The Complexity of Vertex Coloring Problems in Uniform Hypergraphs with High Degree (English)
    0 references
    0 references
    16 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references