Multicoloring the incidentors of a weighted directed multigraph
From MaRDI portal
Publication:5264749
DOI10.1134/S1990478914040188zbMATH Open1324.05069OpenAlexW4243632120MaRDI QIDQ5264749FDOQ5264749
Publication date: 27 July 2015
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478914040188
Recommendations
- Multicoloring the incidentors of a weighted undirected multigraph
- On bounds for the incidentor chromatic number of a directed weighted multigraph
- On the coloring of incidentors in an oriented weighted multigraph
- Bounds for the incidentor chromatic number of a weighted undirected multigraph
- On list incidentor coloring of a multigraph of degree 3
Cites Work
Cited In (12)
- Gap one bounds for the equitable chromatic number of block graphs
- The incidentor coloring of multigraphs and its applications
- Characterizing and edge-colouring split-indifference graphs
- Applications of edge coloring of multigraphs to vertex coloring of graphs
- On the chromatic index of multigraphs without large triangles
- Relations between parameters of a graph
- On the chromatic index of almost all graphs
- The chromatic index of graphs with large maximum degree
- Vizing's adjacency lemma on edge chromatic critical signed graphs and its applications
- Title not available (Why is that?)
- On graphs critical with respect to edge-colourings
- Some parameters of graph and its complement
This page was built for publication: Multicoloring the incidentors of a weighted directed multigraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5264749)
