A new formula for the decycling number of regular graphs (Q2404396): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2017.07.011 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2017.07.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743284597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling numbers of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / 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: The decycling number of generalized Petersen graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility Among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decycling Cartesian Products of Two Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Geometry and Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decycling Number of Cubic Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3540287 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decycling number and maximum genus of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On feedback vertex sets and nonseparating independent sets in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2859823 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2017.07.011 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:35, 18 December 2024

scientific article
Language Label Description Also known as
English
A new formula for the decycling number of regular graphs
scientific article

    Statements

    A new formula for the decycling number of regular graphs (English)
    0 references
    0 references
    0 references
    0 references
    18 September 2017
    0 references
    decycling number
    0 references
    margin number
    0 references
    cycle rank
    0 references
    Betti deficiency
    0 references
    regular graphs
    0 references

    Identifiers