On perfect matchings of complements of line graphs

MaRDI QIDQ3073547zbMATH OpenFDO

Authors Xinhui An, Baoyindureng Wu, Xiaoping Liu

Publication date 11 February 2011

zbMATH Keywords

line graphclaw-free graphperfect matchingjump graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Hamiltonian jump graphs
• scientific article; zbMATH DE number 4064510
• A new lower bound for the number of perfect matchings of line graph
• Clique-perfectness of complements of line graphs
• On the number of perfect matchings of line graphs

Cited in

(3)

• Hamiltonian jump graphs
• Domination number and feedback vertex number of complements of line graphs
• Touching perfect matchings and halving lines

This page was built for publication: On perfect matchings of complements of line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3073547)