Removable paths and cycles with parity constraints (Q402593): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bruce A. Reed / rank
Normal rank
 
Property / author
 
Property / author: Bruce A. Reed / 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.jctb.2014.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060031821 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph connectivity after path removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable cycles in non-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A weaker version of Lovász' path removal conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-separating paths in 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced paths in 5-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Erdős-Pósa property for odd cycles in graphs of large connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:38, 8 July 2024

scientific article
Language Label Description Also known as
English
Removable paths and cycles with parity constraints
scientific article

    Statements

    Removable paths and cycles with parity constraints (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2014
    0 references
    connectivity in graphs
    0 references
    removable paths and cycles
    0 references
    non-separating paths and cycles
    0 references
    parity in path and cycles
    0 references

    Identifiers