On a conjecture on the balanced decomposition number
From MaRDI portal
Publication:389207
DOI10.1016/j.disc.2013.02.012zbMath1408.05059OpenAlexW1975284577WikidataQ122958009 ScholiaQ122958009MaRDI QIDQ389207
Gerard Jennhwa Chang, Narayanan Narayanan
Publication date: 20 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.02.012
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal acyclic edge colouring of grid like graphs
- Balanced decomposition of a vertex-colored graph
- The balanced decomposition number of TK_{4} and series -parallel graphs
- The Balanced Decomposition Number and Vertex Connectivity
- Strong Chromatic Index of 2-Degenerate Graphs
- Minimally 2-connected graphs.
- On Minimal Blocks
This page was built for publication: On a conjecture on the balanced decomposition number