Transforming a graph into a 1-balanced graph

DOI10.1016/j.dam.2008.03.012zbMath1200.05228OpenAlexW2143001072MaRDI QIDQ1003673

Hongyuan Lai, Lavanya Kannan, Hong-Jian Lai, Arthur M. Hobbs

Publication date: 4 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.03.012

zbMATH Keywords

fractional arboricityuniformly densemolecularstrongly balanced

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Ordering of the elements of a matroid such that its consecutive w elements are independent
• Convex hulls of dense balanced graphs
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• A faster algorithm for computing the strength of a network
• Submodular functions and electrical networks
• Connectivity and edge-disjoint spanning trees
• On graphs and rigidity of plane skeletal structures
• Every graph is contained in a sparsest possible balanced graph
• Optimal attack and reinforcement of a network
• Strongly balanced graphs and random graphs
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• Computing the Strength of a Graph
• THRESHOLD FUNCTIONS FOR SOME PROPERTIES OF RANDOM SUBSETS OF PROJECTIVE SPACES