Braces of perfect matching width 2

DOI10.37236/10716MaRDI QIDQ7007760zbMATH OpenFDO

Authors Archontia C. Giannopoulou, Meike Hatzel, Sebastian Wiederrecht

Publication date 25 March 2025

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.37236/10716

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph minors (05C83)

Cites work

• A characterization of convertible (0,1)-matrices
• A survey of Pfaffian orientations of graphs
• Brace generation
• Cyclewidth and the grid theorem for perfect matching width of bipartite graphs
• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Generating bricks
• Graph Drawing
• scientific article; zbMATH DE number 4066957 (Why is no real title available?)
• Matching structure and the matching lattice
• Matching theory
• Maximum matching width: new characterizations and a fast algorithm for dominating set
• Minimally non-Pfaffian graphs
• On n-extendable graphs
• Permanents, Pfaffian orientations, and even directed circuits
• Pólya's permanent problem
• The point-set embeddability problem for plane graphs
• Thin edges in braces

This page was built for publication: Braces of perfect matching width 2

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