Transforming a graph into a 1-balanced graph

DOI10.1016/J.DAM.2008.03.012MaRDI QIDQ1003673zbMATH OpenOpenAlexFDO

Authors Lavanya Kannan, Hong-Jian Lai, Hongyuan 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)

Recommendations

• Graphes équilibrés et arboricité rationnelle. (Balanced graphs and rational arboricity)
• scientific article; zbMATH DE number 54793
• Balanced and 1-balanced graph constructions
• On strongly balanced graphs
• Balanced graphs and network flows

Cites work

• scientific article; zbMATH DE number 4130426 (Why is no real title available?)
• scientific article; zbMATH DE number 3173143 (Why is no real title available?)
• scientific article; zbMATH DE number 3865331 (Why is no real title available?)
• scientific article; zbMATH DE number 4041966 (Why is no real title available?)
• scientific article; zbMATH DE number 3750966 (Why is no real title available?)
• scientific article; zbMATH DE number 125475 (Why is no real title available?)
• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 501471 (Why is no real title available?)
• scientific article; zbMATH DE number 568785 (Why is no real title available?)
• scientific article; zbMATH DE number 4121463 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
• A faster algorithm for computing the strength of a network
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Computing the Strength of a Graph
• Connectivity and edge-disjoint spanning trees
• Convex hulls of dense balanced graphs
• Every graph is contained in a sparsest possible balanced graph
• Fractional arboricity, strength, and principal partitions in graphs and matroids
• On graphs and rigidity of plane skeletal structures
• Optimal attack and reinforcement of a network
• Ordering of the elements of a matroid such that its consecutive w elements are independent
• Random graphs.
• Strongly balanced graphs and random graphs
• Submodular functions and electrical networks
• THRESHOLD FUNCTIONS FOR SOME PROPERTIES OF RANDOM SUBSETS OF PROJECTIVE SPACES

Cited in

(3)

• Cyclic base ordering of certain degenerate graphs
• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Cyclic base ordering of generalized Petersen graphs

This page was built for publication: Transforming a graph into a 1-balanced graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1003673)