Pages that link to "Item:Q4485192"

The following pages link to On Four-Connecting a Triconnected Graph (Q4485192):

Displaying 17 items.

• An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633) (← links)
• \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs (Q658001) (← links)
• Graph connectivity and its augmentation: Applications of MA orderings (Q697579) (← links)
• 4-connected triangulations and 4-orderedness (Q708369) (← links)
• Improved algorithms for graph four-connectivity (Q808289) (← links)
• Smallest bipartite bridge-connectivity augmentation (Q834588) (← links)
• The bridge-connectivity augmentation problem with a partition constraint (Q982661) (← links)
• Maintaining the classes of 4-edge-connectivity in a graph on-line (Q1386336) (← links)
• On triangulating planar graphs under the four-connectivity constraint (Q1386769) (← links)
• On hypergraphs with every four points spanning at most two triples (Q1408551) (← links)
• The graph of triangulations of a point configuration with \(d+4\) vertices is 3-connected (Q1569851) (← links)
• Independence free graphs and vertex connectivity augmentation (Q1775893) (← links)
• On the cycle augmentation problem: hardness and approximation algorithms (Q2230719) (← links)
• Algorithm and complexity of the two disjoint connected dominating sets problem on trees (Q2335669) (← links)
• A unified framework for bi(tri)connectivity and chordal augmentation (Q2841986) (← links)
• (Q4281642) (← links)
• THE EXISTENCE CONDITION OF A 4-CONNECTED GRAPH WITH SPECIFIED CONFIGURATIONS (Q5208621) (← links)