A degree condition for a graph to have \((a,b)\)-parity factors (Q2411624): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2017.08.035 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963667431 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1606.04608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors with all degrees odd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on odd factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New sufficient conditions for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for the existence ofk-factors / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2017.08.035 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:45, 18 December 2024

scientific article
Language Label Description Also known as
English
A degree condition for a graph to have \((a,b)\)-parity factors
scientific article

    Statements

    A degree condition for a graph to have \((a,b)\)-parity factors (English)
    0 references
    0 references
    0 references
    24 October 2017
    0 references
    degree condition
    0 references
    parity factor
    0 references

    Identifiers