On the f-coloring of multigraphs
From MaRDI portal
Publication:3778781
DOI10.1109/31.1747zbMath0638.05024OpenAlexW2134670720MaRDI QIDQ3778781
Nobuji Saito, Shin-ichi Nakano, Takao Nishizeki
Publication date: 1988
Published in: IEEE Transactions on Circuits and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/31.1747
Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15)
Related Items (19)
A parallel algorithm for edge-coloring partial k-trees ⋮ A note on M2-edge colorings of graphs ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ The method of coloring in graphs and its application ⋮ \(\mathrm{M}_2\)-edge colorings of cacti and graph joins ⋮ Path multicoloring in spider graphs with even color multiplicity ⋮ On \(f\)-colorings of nearly bipartite graphs ⋮ \(f\)-colorings of some graphs of \(f\)-class 1 ⋮ A note on the \((g, f)\)-coloring ⋮ Some graphs of class 1 for \(f\)-colorings ⋮ On the fg-coloring of graphs ⋮ Wavelength assignment in multifiber star networks ⋮ A note on the edge cover chromatic index of multigraphs ⋮ On the fractionalf-chromatic index of a graph ⋮ On thef-matching polytope and the fractionalf-chromatic index ⋮ The classification of complete graphs \(K_n\) on \(f\)-coloring ⋮ Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings ⋮ Some sufficient conditions for a graph to be of \(C_f\) 1
This page was built for publication: On the f-coloring of multigraphs
