A special f-edge cover-coloring of multigraphs
From MaRDI portal
Publication:949274
DOI10.1007/S12190-007-0027-YzbMATH Open1155.05028OpenAlexW2048510168MaRDI QIDQ949274FDOQ949274
Authors: Yongxun Xin, Guizhen Liu 
Publication date: 21 October 2008
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-007-0027-y
Recommendations
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- A sufficient condition for equitable edge-colourings of simple graphs
- Newton's method, zeroes of vector fields, and the Riemannian center of mass
- A generalization of edge-coloring in graphs
- On \(f\)-edge cover-coloring in multigraphs
- Edge-Coloring Problems for Graphs.
- Edge covering coloring and fractional edge covering coloring
- Chromatic sums of nonseparable simple maps on the plane.
- Chromatic sums of singular maps on some surfaces.
- On decompositions of a multi-graph into spanning subgraphs
- Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
Cited In (8)
- On \(f\)-edge cover coloring of nearly bipartite graphs
- A note on the edge cover chromatic index of multigraphs
- On super \(f\)-edge cover-coloring of multigraphs
- On the f-coloring of multigraphs
- On super \(f\)-edge cover-coloring in multigraphs
- On \(f\)-edge cover chromatic index of multigraphs
- On \(f\)-edge cover-coloring in multigraphs
- On \(f\)-edge cover-colouring of simple graphs
This page was built for publication: A special \(f\)-edge cover-coloring of multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q949274)
