The number of 1-factors in 2k-connected graphs (Q1253256): 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: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(78)90011-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2021055117 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the 1-factors of a non-separable graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-Faktoren von Graphen. (1-factors of graphs) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:06, 13 June 2024

scientific article
Language Label Description Also known as
English
The number of 1-factors in 2k-connected graphs
scientific article

    Statements

    Identifiers