On the fg-coloring of graphs
From MaRDI portal
Publication:2277478
Recommendations
Cites work
- scientific article; zbMATH DE number 3918395 (Why is no real title available?)
- scientific article; zbMATH DE number 3654142 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1534644 (Why is no real title available?)
- A Theorem on Coloring the Lines of a Network
- A better than “best possible” algorithm to edge color multigraphs
- A generalization of edge-coloring in graphs
- On the f-coloring of multigraphs
- Scheduling File Transfers
- Some results in chromatic scheduling
- The NP-Completeness of Edge-Coloring
Cited in
(10)- On decomposing even regular multigraphs into small isomorphic trees
- scientific article; zbMATH DE number 1555935 (Why is no real title available?)
- scientific article; zbMATH DE number 2097452 (Why is no real title available?)
- \(F\)-WORM colorings: results for 2-connected graphs
- On the f-coloring of multigraphs
- The method of coloring in graphs and its application
- On coloring problems for two-season multigraphs
- Edge-coloring of multigraphs
- Revisiting a theorem by Folkman on graph colouring
- Vertex colourings of multigraphs with forbiddances on edges
This page was built for publication: On the fg-coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277478)