Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On perfect matchings of complements of line graphs

From MaRDI portal
Publication:3073547
Jump to:navigation, search

zbMATH Open1224.05417MaRDI QIDQ3073547FDOQ3073547


Authors: Xinhui An, Baoyindureng Wu, Xiaoping Liu Edit this on Wikidata


Publication date: 11 February 2011





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


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)



Cited In (3)

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





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3073547&oldid=16127691"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:47. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki