On the simultaneous edge coloring of graphs
From MaRDI portal
Abstract: On the simultaneous edge coloring of graphs
Recommendations
Cites work
- A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
- Double covers of cubic graphs with oddness 4
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Even circuits in planar graphs
- Even cycle decompositions of 4-regular graphs and line graphs
- Existence of k-edge connected ordinary graphs with prescribed degrees
- Five cycle double covers of some cubic graphs
- Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
- On a conjecture of Keedwell and the cycle double cover conjecture
- On cycle-double covers of graphs of small oddness
- On Edge-Colorability of Cartesian Products of Graphs*
- On even circuit decompositions of eulerian graphs
- On the possible volumes of \(\mu\)-way Latin trades
- On the simultaneous edge-coloring conjecture
- Polyhedral decompositions of cubic graphs
- The theory and application of latin bitrades: A survey
- The three-way intersection problem for Latin squares
Cited in
(11)- Vertex-, edge-, and total-colorings of Sierpiński-like graphs
- On simultaneous edge-face colorings of plane graphs
- On resolving edge colorings in graphs
- On the simultaneous edge-coloring conjecture
- On a conjecture of Keedwell and the cycle double cover conjecture
- Simultaneous embedding of colored graphs
- A note on the simultaneous edge coloring
- On the Number of Synchronizing Colorings of Digraphs
- scientific article; zbMATH DE number 68344 (Why is no real title available?)
- Simultaneous coloring of vertices and incidences of outerplanar graphs
- Color trades on n-cubes and complete bipartite graphs
This page was built for publication: On the simultaneous edge coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2931912)
