Partitioning a graph into two square-cycles (Q4715278): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
label / enlabel / en
 
Partitioning a graph into two square-cycles
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199611)23:3<241::aid-jgt4>3.0.co;2-s / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4231960493 / rank
 
Normal rank
Property / title
 
Partitioning a graph into two square-cycles (English)
Property / title: Partitioning a graph into two square-cycles (English) / rank
 
Normal rank

Latest revision as of 08:31, 30 July 2024

scientific article; zbMATH DE number 944218
Language Label Description Also known as
English
Partitioning a graph into two square-cycles
scientific article; zbMATH DE number 944218

    Statements

    16 December 1996
    0 references
    minimum degree
    0 references
    powers of graphs
    0 references
    square-cycle
    0 references
    cycle
    0 references
    Pósa conjecture
    0 references
    0 references
    0 references
    Partitioning a graph into two square-cycles (English)
    0 references

    Identifiers