Removable edges in near-bipartite bricks

DOI10.1002/jgt.23173MaRDI QIDQ6642518

Jinjiang Yuan, Fuliang Lu, Yi-pei Zhang, Xiumei Wang

Publication date: 24 November 2024

Published in: Journal of Graph Theory (Search for Journal in Brave)

zbMATH Keywords

perfect matchingremovable edgebricknear-bipartite graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• A lower bound on the number of removable ears of 1-extendable graphs
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• A characterisation of Pfaffian near bipartite graphs
• A generalization of Little's theorem on Pfaffian orientations
• On essentially 4-edge-connected cubic bricks
• \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks
• Graphs with independent perfect matchings
• On perfect matchings in matching covered graphs
• Generating near‐bipartite bricks
• The Factorization of Linear Graphs
• Generating simple near‐bipartite bricks

This page was built for publication: Removable edges in near-bipartite bricks