A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2011.09.027 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1002.4739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings in planar cubic graphs / 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: Brick decompositions and the matching rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linear bound on the number of perfect matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound on the Number of Perfect Matchings in Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: Perfect matchings in claw-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184837 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2011.09.027 / rank
 
Normal rank

Latest revision as of 16:48, 9 December 2024

scientific article
Language Label Description Also known as
English
A superlinear bound on the number of perfect matchings in cubic bridgeless graphs
scientific article

    Statements

    Identifiers