Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
[Submitted on 23 Dec 2022 ( v1 ), last revised 26 May 2023 (this version, v4)] Title:Matching Cuts in Graphs of High Girth and H-Free Graphs Download a PDF of the paper titled Matching Cuts in Graphs of High Girth and H-Free Graphs, by Carl Feghali and 3 other authors Download PDF Abstract: The (Perfect) Matching Cut problem is to decide if a connected graph has a (perfect) matching that is also an edge cut.
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.