The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (Q2685343): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2023.113342 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4318953856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with polynomially solvable maximum-weight clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2822598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properly 2-Colouring Linear Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring vertices of triangle-free graphs without forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Generating All the Maximal Independent Sets / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2023.113342 / rank
 
Normal rank

Latest revision as of 18:13, 19 December 2024

scientific article
Language Label Description Also known as
English
The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
scientific article

    Statements

    The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size (English)
    0 references
    0 references
    0 references
    21 February 2023
    0 references
    hypergraph
    0 references
    coloring algorithm
    0 references
    induced subhypergraph
    0 references
    matching number
    0 references
    linear hypergraph
    0 references

    Identifiers

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