← All problems

Gartland–Lokshtanov conjectures on induced matching treewidth

This entry tracks Gartland–Lokshtanov conjectures on induced matching treewidth.

It advances the structural classification behind algorithms on graph classes with bounded induced matching treewidth.

Latest development

The paper identifies bounded and unbounded induced matching treewidth classes and derives balanced-separator consequences.

Editorial caveat

The underlying conjectures are not completely resolved.

References

Source: arXiv

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.