Total weight choosability of Cartesian product of graphs
From MaRDI portal
(Redirected from Publication:449198)
Recommendations
- Total weight choosability of graphs
- Total weight choosability of graphs
- On total weight choosability of graphs
- Weight choosability of graphs
- Total weight choosability of Mycielski graphs
- Total weight choosability for Halin graphs
- Total weight choosability of cone graphs
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- Total domination of Cartesian products of graphs
- Total weight choosability of graphs with bounded maximum average degree
Cites work
- A nowhere-zero point in linear mappings
- Colorings and orientations of graphs
- Combinatorial Nullstellensatz
- Edge weights and vertex colours
- Total weight choosability of graphs
- Total Weight Choosability of Trees
- Vertex colouring edge partitions
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex-colouring edge-weightings
- Weight choosability of graphs
Cited in
(11)- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- Weight choosability of graphs with maximum degree 4
- Total weight choosability of graphs with bounded maximum average degree
- Total weight choosability of cone graphs
- Total weight choosability for Halin graphs
- Total weight choosability of Mycielski graphs
- Every graph is (2,3)-choosable
- Total Weight Choosability of Trees
- Total list weighting of Cartesian product of graphs
- On the permanent indices of graphs
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
This page was built for publication: Total weight choosability of Cartesian product of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449198)
