On the fg-coloring of graphs
From MaRDI portal
Publication:2277478
DOI10.1007/BF02122697zbMath0725.05040OpenAlexW1486913849MaRDI QIDQ2277478
Takao Nishizeki, Shin-ichi Nakano, Nobuji Saito
Publication date: 1990
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02122697
Related Items
The method of coloring in graphs and its application, On decomposing even regular multigraphs into small isomorphic trees, Edge-coloring of multigraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A better than “best possible” algorithm to edge color multigraphs
- A generalization of edge-coloring in graphs
- Scheduling File Transfers
- On the f-coloring of multigraphs
- The NP-Completeness of Edge-Coloring
- Some results in chromatic scheduling
- A Theorem on Coloring the Lines of a Network