On the f-coloring of multigraphs

DOI10.1109/31.1747MaRDI QIDQ3778781zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

f-chromatic indexf-coloringmultigraphpolynomial-time algorithmscheduling problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On the fg-coloring of graphs
• On f-edge cover-coloring in multigraphs
• On multiset colorings of graphs
• On \(\mathrm{M}_f\)-edge colorings of graphs
• On \(f\)-colorings of nearly bipartite graphs
• A special \(f\)-edge cover-coloring of multigraphs
• On multichromatic numbers of widely colorable graphs
• On DP-coloring of graphs and multigraphs
• Greedy \(F\)-colorings of graphs
• Sur le coloriage des graphs

Cited in

(24)

• Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
• Path multicoloring in spider graphs with even color multiplicity
• On \(f\)-colorings of nearly bipartite graphs
• On the fg-coloring of graphs
• \(F\)-WORM colorings: results for 2-connected graphs
• The method of coloring in graphs and its application
• Some graphs of class 1 for \(f\)-colorings
• The classification of complete graphs \(K_n\) on \(f\)-coloring
• Wavelength assignment in multifiber star networks
• On multiset colorings of graphs
• On the fractional f-chromatic index of a graph
• A note on M2-edge colorings of graphs
• scientific article; zbMATH DE number 1555935 (Why is no real title available?)
• A parallel algorithm for edge-coloring partial k-trees
• On thef-matching polytope and the fractionalf-chromatic index
• Some results about f‐critical graphs
• Simple reduction of f-colorings to edge-colorings
• Orientation‐based edge‐colorings and linear arboricity of multigraphs
• On an f-coloring generalization of linear arboricity of multigraphs
• Some sufficient conditions for a graph to be of \(C_f\) 1
• \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
• f-colorings of some graphs of f-class 1
• A note on the \((g, f)\)-coloring
• A note on the edge cover chromatic index of multigraphs

This page was built for publication: On the f-coloring of multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3778781)