The number of vertices of degree 5 in a contraction-critically 5-connected graph (Q2275451): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.04.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964540042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertices of degree 5 in a contraction critically 5-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: Q4166780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncontractable 4-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonseparating cycles inK-Connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284374 / rank
 
Normal rank

Latest revision as of 09:44, 4 July 2024

scientific article
Language Label Description Also known as
English
The number of vertices of degree 5 in a contraction-critically 5-connected graph
scientific article

    Statements

    Identifiers