Recommendations
- 3-consecutive vertex coloring of a graph
- 3-consecutive C-colorings of graphs
- Three edge-coloring conjectures
- Conjectures on uniquely 3-edge-colorable graphs
- Edge-coloring of 3-uniform hypergraphs
- Consecutive colorings of the edges of general graphs
- scientific article; zbMATH DE number 3878955
- Publication:4351080
- On 3-hued coloring of graphs
- On colorful edge triples in edge-colored complete graphs
Cites work
- scientific article; zbMATH DE number 1161313 (Why is no real title available?)
- 3-consecutive C-colorings of graphs
- 3-consecutive edge coloring of a graph
- 3-consecutive vertex coloring of a graph
- A note on fragile graphs
- Improper C-colorings of graphs
- Matching cutsets in graphs
- Matching cutsets in graphs of diameter 2
- On stable cutsets in claw-free graphs and planar graphs
- On stable cutsets in graphs
- On stable cutsets in line graphs
- Parallel concepts in graph theory
Cited in
(15)- Consecutive edge-coloring of the generalized \(\theta \)-graph
- Consecutive colorings of the edges of general graphs
- \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
- 3-consecutive edge coloring of a graph
- Complexity of Computing the Anti-Ramsey Numbers for Paths.
- 3-consecutive vertex coloring of a graph
- Maximum number of colors: C-coloring and related problems
- Consecutive edge-colorings of generalized \(\theta \)-graphs
- Vertex neighborhood restricted edge achromatic sums of graphs
- Injective edge coloring of graphs
- scientific article; zbMATH DE number 7589550 (Why is no real title available?)
- Consecutive colorings of graphs
- 3-consecutive C-colorings of graphs
- 3-sequent achromatic sum of graphs
- When the vertex coloring of a graph is an edge coloring of its line graph -- a rare coincidence.
This page was built for publication: 3-consecutive edge coloring of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q658096)
