Transforming a graph into a 1-balanced graph

DOI10.1016/J.DAM.2008.03.012zbMATH Open1200.05228OpenAlexW2143001072MaRDI QIDQ1003673FDOQ1003673

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

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

zbMATH Keywords

fractional arboricityuniformly densemolecularstrongly balanced

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Characterization of removable elements with respect to having \(k\) disjoint bases in a matroid
• Cyclic base ordering of generalized Petersen graphs
• Cyclic base ordering of certain degenerate 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)