Partition the vertices of a graph into one independent set and one acyclic set (Q2497500): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q698369
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Aifeng Yang / rank
 
Normal rank
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.disc.2005.09.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068819940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of some problems related to GRAPH 3-COLORABILITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-arboricity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232836 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex arboricity of planar graphs of diameter two / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(r\)-bounded \(k\)-complete bipartite bihypergraphs and generalized split graphs / rank
 
Normal rank

Latest revision as of 18:32, 24 June 2024

scientific article
Language Label Description Also known as
English
Partition the vertices of a graph into one independent set and one acyclic set
scientific article

    Statements

    Partition the vertices of a graph into one independent set and one acyclic set (English)
    0 references
    0 references
    0 references
    4 August 2006
    0 references
    near-bipartition
    0 references
    acyclic set
    0 references
    independent set
    0 references

    Identifiers