Non-separating subgraphs in highly connected graphs (Q905893): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q214979
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Ken-ichi Kawarabayashi / 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.2015.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2198977702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some forbidden subgraph conditions for a graph to have a \(k\)-contractible edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4]\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A connected subgraph maintaining high connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of graphs with condition on the connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contractible edges and triangles in \(k\)-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend großer Kantendichte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizaions of critical connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition with constraints on the connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3808121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Draw a Graph / rank
 
Normal rank

Latest revision as of 10:04, 11 July 2024

scientific article
Language Label Description Also known as
English
Non-separating subgraphs in highly connected graphs
scientific article

    Statements

    Non-separating subgraphs in highly connected graphs (English)
    0 references
    0 references
    0 references
    28 January 2016
    0 references
    decomposition
    0 references
    highly connected subgraph
    0 references
    contractible edges
    0 references
    non-separating induced cycle
    0 references
    triangles
    0 references
    cycles
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references