Generating simple near‐bipartite bricks

DOI10.1002/jgt.22579zbMath1526.05116arXiv1704.08796OpenAlexW3026418435MaRDI QIDQ6134648

Nishad Kothari, Marcelo H. De Carvalho

Publication date: 22 August 2023

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

Full work available at URL: https://arxiv.org/abs/1704.08796

zbMATH Keywords

bricksmatching covered graphbrick generationthin edgenear-bipartite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Unnamed Item
• Brick decompositions and the matching rank of graphs
• Matching theory
• Matching structure and the matching lattice
• Ear decompositions of matching covered graphs
• Decomposition of regular matroids
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice
• On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph
• How to build a brick
• Generating bricks
• Brace generation
• Generating near‐bipartite bricks

This page was built for publication: Generating simple near‐bipartite bricks