On resolving edge colorings in graphs

DOI10.1155/S0161171203211492zbMATH Open1026.05041OpenAlexW2007465671MaRDI QIDQ1415146FDOQ1415146

Ping Zhang, Varaporn Saenpholphat

Publication date: 3 December 2003

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/50417

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (4)

• Title not available (Why is that?)
• On edge orienting methods for graph coloring
• Reachability problems in edge-colored digraphs
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On edge covering colorings of graphs 👍 👎
• A generalization of edge-coloring in graphs 👍 👎
• Some results on edge-colourings of graphs 👍 👎
• Edge-Coloring Problems for Graphs. 👍 👎
• Graph edge coloring: a survey 👍 👎
• On the simultaneous edge coloring of graphs 👍 👎

This page was built for publication: On resolving edge colorings in graphs

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