An improved linear bound on the number of perfect matchings in cubic graphs (Q976154): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Perfect matchings in planar cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with independent perfect matchings / 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: On the Permanent of a Certain Class of (0, 1)-Matrices / 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: On Lower Bounds for Permanents of (0, 1) Matrices / 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: Q3897156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting 1-factors in regular bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concerning a Conjecture of Marshall Hall / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4184837 / rank
 
Normal rank

Revision as of 21:57, 2 July 2024

scientific article
Language Label Description Also known as
English
An improved linear bound on the number of perfect matchings in cubic graphs
scientific article

    Statements

    Identifiers