Orthogonal factorizations of digraphs (Q1042545): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4026144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal factorizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen / 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 networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal \((g,f)\)-factorizations in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal \((g,f)\)-factorizations of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems on factorizations with constraints in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-Factors of Oriented Graphs / rank
 
Normal rank

Latest revision as of 07:40, 2 July 2024

scientific article
Language Label Description Also known as
English
Orthogonal factorizations of digraphs
scientific article

    Statements

    Identifiers