Orthogonal (g, f)-factorizations in networks (Q4506268): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Orthogonal (g, f)-factorizations in networks
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic proof of Tutte's f-factor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple existence criterion for \((g<f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Degree Constrained Graph Factors of Minimum Deficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: [a,b]-factorization of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal \((g,f)\)-factorizations in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs having all \((g,f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4332941 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/1097-0037(200007)35:4<274::aid-net6>3.0.co;2-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1997241393 / rank
 
Normal rank
Property / title
 
Orthogonal (g, f)-factorizations in networks (English)
Property / title: Orthogonal (g, f)-factorizations in networks (English) / rank
 
Normal rank

Latest revision as of 09:39, 30 July 2024

scientific article; zbMATH DE number 1508268
Language Label Description Also known as
English
Orthogonal (g, f)-factorizations in networks
scientific article; zbMATH DE number 1508268

    Statements

    0 references
    0 references
    0 references
    0 references
    12 December 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    network
    0 references
    graph
    0 references
    \((g,f)\)-factorization
    0 references
    orthogonal factorization
    0 references
    0 references
    Orthogonal (g, f)-factorizations in networks (English)
    0 references