Matchings in regular graphs (Q1155070): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q4101844 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3864558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defect-d matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405192 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065587 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank of maximum matchings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4080661 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4078069 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(81)90006-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032495288 / rank
 
Normal rank

Latest revision as of 10:35, 30 July 2024

scientific article
Language Label Description Also known as
English
Matchings in regular graphs
scientific article

    Statements

    Identifiers