Edge covering coloring of nearly bipartite graphs
From MaRDI portal
Publication:854458
DOI10.1007/BF02896491zbMATH Open1114.05042OpenAlexW1964919978MaRDI QIDQ854458FDOQ854458
Authors: Xia Zhang, Jihui Wang, Guizhen Liu 
Publication date: 4 December 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02896491
Recommendations
- A note on edge-cover coloring of nearly bipartite graphs
- On \(f\)-edge cover coloring of nearly bipartite graphs
- Edge coloring nearly bipartite graphs
- On edge covering colorings of graphs
- Edge-coloring almost bipartite multigraphs
- On the edge colouring of bipartite graphs
- Edge-Coloring Bipartite Graphs
- Edge covering coloring and fractional edge covering coloring
- Edge coloring of bipartite graphs with constraints
- scientific article; zbMATH DE number 1418353
Cites Work
- Graph theory with applications
- The NP-Completeness of Edge-Coloring
- A sufficient condition for equitable edge-colourings of simple graphs
- 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 (7)
- On \(f\)-edge cover coloring of nearly bipartite graphs
- Edge covering coloring and fractional edge covering coloring
- On \(g_c\)-colorings of nearly bipartite graphs.
- Fractional \(f\)-edge cover chromatic index of graphs
- Representing branched coverings by edge-coloured graphs
- Vertex-disjoint quadrilaterals containing specified edges in a bipartite graph
- On edge covering colorings of graphs
This page was built for publication: Edge covering coloring of nearly bipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854458)
