An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues (Q2185908): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3013919929 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2003.12834 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors with all degrees odd / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for the existence of 1-factors in graphs or their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3258698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient condition for the existence of an even \([a,b]\)-factor in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalues and \([1,n]\)-odd factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type conditions for the existence of even \([2,b]\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient conditions for the existence of a 1-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank

Latest revision as of 20:39, 22 July 2024

scientific article
Language Label Description Also known as
English
An odd \([ 1 , b ]\)-factor in regular graphs from eigenvalues
scientific article

    Statements

    Identifiers