The inclusion-free edge-colorings of (3, )-bipartite graphs
From MaRDI portal
Publication:2172399
Recommendations
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- Colouring of (P₃ P₂)-free graphs
- On the maximal triangle-free edge-chromatic graphs in three colors
- On the edge colouring of bipartite graphs
- On interval -coloring of bipartite graphs
- Edge-colorings of complete bipartite graphs without large rainbow trees
- On colorful edge triples in edge-colored complete graphs
- scientific article; zbMATH DE number 165470
- Some remarks on interval colorings of complete tripartite and biregular graphs
- On acyclic edge-coloring of complete bipartite graphs
Cites work
- \(\Delta+300\) is a bound on the adjacent vertex distinguishing edge chromatic number
- A note on the strong chromatic index of bipartite graphs
- Adjacent strong edge coloring of graphs
- Adjacent Vertex Distinguishing Edge‐Colorings
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- On induced matchings
- Progress on the adjacent vertex distinguishing edge coloring conjecture
- Strict neighbor-distinguishing index of subcubic graphs
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs
- The strong chromatic index of a class of graphs
Cited in
(3)
This page was built for publication: The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2172399)
