The decycling number of generalized Petersen graphs (Q479058): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / 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: Feedback vertex set in hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5387730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets in star graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bounds of feedback numbers of \((n,k)\)-star graphs / rank
 
Normal rank

Latest revision as of 09:27, 9 July 2024

scientific article
Language Label Description Also known as
English
The decycling number of generalized Petersen graphs
scientific article

    Statements

    The decycling number of generalized Petersen graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    5 December 2014
    0 references
    decycling set
    0 references
    decycling number
    0 references
    generalized Petersen graphs
    0 references
    cycles
    0 references
    acyclic subgraph
    0 references

    Identifiers