Pages that link to "Item:Q1055426"

The following pages link to Brick decompositions and the matching rank of graphs (Q1055426):

Displaying 50 items.

• Average connectivity and average edge-connectivity in graphs (Q390306) (← links)
• Three-matching intersection conjecture for perfect matching polytopes of small dimensions (Q390921) (← links)
• A superlinear bound on the number of perfect matchings in cubic bridgeless graphs (Q412270) (← links)
• Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
• Efficient edge-skeleton computation for polytopes defined by oracles (Q491253) (← links)
• Exponentially many perfect matchings in cubic graphs (Q555602) (← links)
• Removable ears of 1-extendable graphs (Q601904) (← links)
• An algorithm to find the lineality space of the positive hull of a set of vectors (Q662122) (← links)
• A Matlab-based rapid method for computing lattice-subspaces and vector sublattices of \(\mathbb R^n\): applications in portfolio insurance (Q734849) (← links)
• Grid graphs, Gorenstein polytopes, and domino stackings (Q844215) (← links)
• Minimally non-Pfaffian graphs (Q947729) (← links)
• Pfaffian labelings and signs of edge colorings (Q949785) (← links)
• An improved linear bound on the number of perfect matchings in cubic graphs (Q976154) (← links)
• Undirected distances and the postman-structure of graphs (Q1099186) (← links)
• The Schrijver system of odd join polyhedra (Q1101352) (← links)
• Matching structure and the matching lattice (Q1112071) (← links)
• On integer points in polyhedra (Q1193530) (← links)
• Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
• Extending matchings in graphs: A survey (Q1322235) (← links)
• Perfect matchings and ears in elementary bipartite graphs (Q1377683) (← links)
• Matching connectivity: on the structure of graphs with perfect matchings (Q1689965) (← links)
• Core index of perfect matching polytope for a 2-connected cubic graph (Q1692642) (← links)
• A branch-and-cut procedure for the Udine course timetabling problem (Q1761891) (← links)
• Toughness and matching extension in graphs (Q1824634) (← links)
• Optimal ear decompositions of matching covered graphs and bases for the matching lattice (Q1850602) (← links)
• A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
• Laminar tight cuts in matching covered graphs (Q2040018) (← links)
• Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844) (← links)
• Graft analogue of general Kotzig-Lovász decomposition (Q2081503) (← links)
• On cycle-nice claw-free graphs (Q2138970) (← links)
• Bicritical graphs without removable edges (Q2166208) (← links)
• On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
• \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks (Q2309225) (← links)
• Erdős-Ko-Rado for perfect matchings (Q2400976) (← links)
• How to build a brick (Q2433703) (← links)
• Minimal bricks have many vertices of small degree (Q2441634) (← links)
• Minimal bricks (Q2496202) (← links)
• Construction for bicritical graphs and \(k\)-extendable bipartite graphs (Q2497479) (← links)
• Permutohedra and minimal matrices (Q2576235) (← links)
• Generating bricks (Q2642014) (← links)
• Brace generation (Q2781060) (← links)
• \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs (Q2811192) (← links)
• Cubic bridgeless graphs have more than a linear number of perfect matchings (Q2851496) (← links)
• Facet Generating Techniques (Q2971603) (← links)
• On Two Unsolved Problems Concerning Matching Covered Graphs (Q3174694) (← links)
• Disjoint Odd Cycles in Cubic Solid Bricks (Q4627479) (← links)
• On the number of dissimilar pfaffian orientations of graphs (Q4680728) (← links)
• A note on tight cuts in matching-covered graphs (Q5038195) (← links)
• Birkhoff--von Neumann Graphs that are PM-Compact (Q5130578) (← links)
• The Cubic Vertices of Minimal Bricks (Q5418766) (← links)