Binding numbers and connected factors (Q607686): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00373-010-0953-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005371816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4156806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected \([k,k+1]\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \([k,k+1]\)-factor containing a given Hamiltonian cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4030686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, trees, and walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected (g, f)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected \([a,b]\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore‐type condition for the existence of connected factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number and minimum degree for k-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian ?-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 12:42, 3 July 2024

scientific article
Language Label Description Also known as
English
Binding numbers and connected factors
scientific article

    Statements

    Identifiers