Decycling with a matching (Q2628271): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Carlos Vinícius G. C. Lima / rank
 
Normal rank
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / 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.ipl.2017.04.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2607478305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance-hereditary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum induced trees in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets in cubic multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating subgraphs in graphs with some forbidden structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating and large induced trees in regular graphs / rank
 
Normal rank

Latest revision as of 22:44, 13 July 2024

scientific article
Language Label Description Also known as
English
Decycling with a matching
scientific article

    Statements

    Decycling with a matching (English)
    0 references
    13 June 2017
    0 references
    decycling
    0 references
    matching
    0 references
    feedback vertex set
    0 references
    graph algorithms
    0 references

    Identifiers