On vertex-parity edge-colorings

DOI10.1007/s10878-017-0178-1zbMath1401.05123OpenAlexW2756592572MaRDI QIDQ1702821

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

Publication date: 1 March 2018

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-017-0178-1

zbMATH Keywords

vertex signaturevertex-parity chromatic indexvertex-parity edge-coloringweak vertex-parity edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

New bounds for locally irregular chromatic index of bipartite and subcubic graphs ⋮ Colorings with neighborhood parity condition ⋮ Remarks on odd colorings of graphs ⋮ Maximum edge-colorings of graphs ⋮ Remarks on proper conflict-free colorings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on weak odd edge-colorings of graphs
• Improved bound on facial parity edge coloring
• Facial parity edge colouring of plane pseudographs
• Flows and parity subgraphs of graphs with large odd-edge-connectivity
• Factors and factorizations of graphs. Proof techniques in factor theory
• Flows and generalized coloring theorems in graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Odd edge-colorability of subcubic graphs
• Odd edge coloring of graphs
• Graph Factors and Matching Extensions
• Odd 4‐edge‐colorability of graphs
• Polyhedral decompositions of cubic graphs
• On the structure of factorizable graphs. II

This page was built for publication: On vertex-parity edge-colorings