Odd edge coloring of graphs

DOI10.26493/1855-3974.576.895zbMATH Open1329.05115OpenAlexW1819709814WikidataQ129355408 ScholiaQ129355408MaRDI QIDQ3465663FDOQ3465663

Authors: Borut Lužar, Mirko Petruševski, Riste Škrekovski 

Publication date: 22 January 2016

Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.26493/1855-3974.576.895

Recommendations

• Odd 4-edge-colorability of graphs
• Odd edge-colorability of subcubic graphs
• Colorings with neighborhood parity condition
• Odd edge‐colorings of subdivisions of odd graphs
• Odd coloring of sparse graphs and planar graphs

zbMATH Keywords

odd subgraphedge coloringedge decompositon

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited In (17)

• Remarks on proper conflict-free colorings of graphs
• Odd 4-edge-colorability of graphs
• A note on weak odd edge-colorings of graphs
• Odd edge-colorability of subcubic graphs
• Locally irregular edge-coloring of subcubic graphs
• Weak-odd edge-coloring of digraphs
• Odd edge‐colorings of subdivisions of odd graphs
• Decomposition of a graph into two disjoint odd subgraphs
• Facially-constrained colorings of plane graphs: a survey
• Odd decompositions and coverings of graphs
• On coloring the odd-distance graph
• On vertex-parity edge-colorings
• Odd graph and its applications to the strong edge coloring
• Maximum edge-colorings of graphs
• Remarks on odd colorings of graphs
• Title not available (Why is that?)
• Colorings with neighborhood parity condition

This page was built for publication: Odd edge coloring of graphs

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