Edge-coloring of 3-uniform hypergraphs (Q729801): 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.1016/j.dam.2016.06.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2493458272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / 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: NP completeness of the edge precoloring extension problem on bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Coloring Circular Arcs and Chords / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4832864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the chromatic index for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(0(n^{1.5})\) algorithm to color proper circular arcs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(qn) algorithm to q-color a proper family of circular arcs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:36, 13 July 2024

scientific article
Language Label Description Also known as
English
Edge-coloring of 3-uniform hypergraphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references