Highly irregular graph decompositions
From MaRDI portal
Cites work
- A general decomposition theory for the 1-2-3 conjecture and locally irregular decompositions
- A Note on the Locally Irregular Edge Colorings of Cacti
- A solution to the 1-2-3 conjecture
- An injective version of the 1-2-3 conjecture
- Decomposability of regular graphs to 4 locally irregular subgraphs
- Decomposing graphs into a constant number of locally irregular subgraphs
- Decomposing split graphs into locally irregular graphs
- Degree sequences of highly irregular graphs
- Edge weights and vertex colours
- Graph classes with locally irregular chromatic index at most 4
- Highly irregular graphs
- Highly irregular graphs with extreme numbers of edges
- Highly irregular m-chromatic graphs
- scientific article; zbMATH DE number 4097437 (Why is no real title available?)
- Irregularity in graphs
- Locally irregular edge-coloring of subcubic graphs
- New bounds for locally irregular chromatic index of bipartite and subcubic graphs
- NP completeness of finding the chromatic index of regular graphs
- On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat}
- On an estimate of the chromatic class of a \(p\)-graph
- On decomposing graphs of large minimum degree into locally irregular subgraphs
- On decomposing regular graphs into locally irregular subgraphs
- On the complexity of determining the irregular chromatic index of a graph
- Parameterized algorithms
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
This page was built for publication: Highly irregular graph decompositions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7033934)
