Pages that link to "Item:Q2367443"

The following pages link to Conservative weightings and ear-decompositions of graphs (Q2367443):

Displaying 23 items.

• Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
• The covering radius of the cycle code of a graph (Q686525) (← links)
• Maximality of the cycle code of a graph (Q1322205) (← links)
• A generalization of Petersen's theorem (Q1801707) (← links)
• Complexity of circuit intersection in graphs (Q1894765) (← links)
• On a matroid defined by ear-decompositions of graphs (Q1924493) (← links)
• Graft analogue of general Kotzig-Lovász decomposition (Q2081503) (← links)
• Degree and regularity of Eulerian ideals of hypergraphs (Q2094866) (← links)
• Joins, ears and Castelnuovo-Mumford regularity (Q2193192) (← links)
• Approximating max-min weighted \(T\)-joins (Q2450657) (← links)
• The edge-orientation problem and some of its variants on weighted graphs (Q2509220) (← links)
• Disclosing Barriers: A Generalization of the Canonical Partition Based on Lovász’s Formulation (Q2867138) (← links)
• On combinatorial properties of binary spaces (Q5101417) (← links)
• Associated primes of powers of edge ideals and ear decompositions of graphs (Q5227983) (← links)
• Two-Connected Spanning Subgraphs with at Most $\frac{10}{7}{OPT}$ Edges (Q5351864) (← links)
• Eulerian ideals (Q5879424) (← links)
• On generalizations of matching-covered graphs (Q5946644) (← links)
• Complexity of finding a join of maximum weight (Q5954077) (← links)
• Approximation algorithms for flexible graph connectivity (Q6120848) (← links)
• Beating the Integrality Ratio for $s$-$t$-Tours in Graphs (Q6139824) (← links)
• Decreasing behavior of the depth functions of edge ideals (Q6154420) (← links)
• A general formula for the index of depth stability of edge ideals (Q6631313) (← links)
• Basilica: new canonical decomposition in matching theory (Q6667586) (← links)