A result on \(r\)-orthogonal factorizations in digraphs (Q2400968): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.ejc.2017.05.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2621103372 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114184783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004080 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4448753 / 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: Room designs and one-factorizations / 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 factorizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((g,f)\)-factorizations orthogonal to a subgraph of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of orthogonal factorizations in graphs / 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 factorizations of digraphs / 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
Property / cites work
 
Property / cites work: Subgraphs with orthogonal factorizations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdigraphs with orthogonal factorizations of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new result on Alspach's problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on orthogonal factorizations of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdigraphs with orthogonal factorizations of digraphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly orthogonal factorizations in networks / rank
 
Normal rank

Latest revision as of 08:51, 14 July 2024

scientific article
Language Label Description Also known as
English
A result on \(r\)-orthogonal factorizations in digraphs
scientific article

    Statements

    A result on \(r\)-orthogonal factorizations in digraphs (English)
    0 references
    0 references
    0 references
    0 references
    31 August 2017
    0 references
    0 references
    \((0,f)\)-factorization
    0 references
    0 references
    0 references