Edge coloring of signed graphs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3717365 (Why is no real title available?)
- scientific article; zbMATH DE number 1299961 (Why is no real title available?)
- COVERING AND PACKING IN GRAPHS, I.
- Graph theory
- Graph theory
- On the Laplacian coefficients of signed graphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Signed graph coloring
- Signed graphs
- Some results on linear arboricity
- The Factorization of Linear Graphs
- The chromatic number of a signed graph
- The linear arboricity of planar graphs of maximum degree seven is four
- The linear arboricity of some regular graphs
Cited in
(15)- Edge coloring of the signed generalized Petersen graph
- Edge coloring signed graphs
- Coloring problem of signed interval graphs
- Bounds for the chromatic index of signed multigraphs
- The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
- The complexity of signed graph and edge-coloured graph homomorphisms
- Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable
- Signed coloring of 2-dimensional grids
- The edge coloring of the Cartesian product of signed graphs
- On colorings and orientations of signed graphs
- Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications
- A note on the vertex arboricity of signed graphs
- Degree choosable signed graphs
- An adjacency lemma on signed edge colorings with an application to planar graphs
- Edge coloring of graphs of signed class 1 and 2
This page was built for publication: Edge coloring of signed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2185748)