On the fg-coloring of graphs

DOI10.1007/BF02122697zbMATH Open0725.05040OpenAlexW1486913849MaRDI QIDQ2277478FDOQ2277478

Authors: Shin-Ichi Nakano, Takao Nishizeki, Nobuji Saito 

Publication date: 1990

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02122697

Recommendations

• On the f-coloring of multigraphs
• Edge-Coloring and f-Coloring for Various Classes of Graphs
• On the $1.1$ Edge-Coloring of Multigraphs
• On \(f\)-edge cover chromatic index of multigraphs
• scientific article; zbMATH DE number 1555935

zbMATH Keywords

multigraphspolynomial time algorithmedge colouringsfg-chromatic indexfg-colourings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The NP-Completeness of Edge-Coloring
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scheduling File Transfers
• A better than “best possible” algorithm to edge color multigraphs
• A Theorem on Coloring the Lines of a Network
• A generalization of edge-coloring in graphs
• Title not available (Why is that?)
• On the f-coloring of multigraphs
• Some results in chromatic scheduling

Cited In (10)

• On decomposing even regular multigraphs into small isomorphic trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• \(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)