On vertex-parity edge-colorings

Borut Lužar (), Mirko Petruševski () and Riste Škrekovski ()
Additional contact information
Borut Lužar: Faculty of Information Studies
Mirko Petruševski: Faculty of Mechanical Engineering-Skopje
Riste Škrekovski: Faculty of Information Studies

Journal of Combinatorial Optimization, 2018, vol. 35, issue 2, No 5, 373-388

Abstract: Abstract A vertex signature $$\pi $$ π of a finite graph G is any mapping $$\pi \,{:}\,V(G)\rightarrow \{0,1\}$$ π : V ( G ) → { 0 , 1 } . An edge-coloring of G is said to be vertex-parity for the pair $$(G,\pi )$$ ( G , π ) if for every vertex v each color used on the edges incident to v appears in parity accordance with $$\pi $$ π , i.e. an even or odd number of times depending on whether $$\pi (v)$$ π ( v ) equals 0 or 1, respectively. The minimum number of colors for which $$(G,\pi )$$ ( G , π ) admits such an edge-coloring is denoted by $$\chi '_p(G,\pi )$$ χ p ′ ( G , π ) . We characterize the existence and prove that $$\chi '_p(G,\pi )$$ χ p ′ ( G , π ) is at most 6. Furthermore, we give a structural characterization of the pairs $$(G,\pi )$$ ( G , π ) for which $$\chi '_p(G,\pi )=5$$ χ p ′ ( G , π ) = 5 and $$\chi '_p(G,\pi )=6$$ χ p ′ ( G , π ) = 6 . In the last part of the paper, we consider a weaker version of the coloring, where it suffices that at every vertex, at least one color appears in parity accordance with $$\pi $$ π . We show that the corresponding chromatic index is at most 3 and give a complete characterization for it.

Keywords: Vertex-parity edge-coloring; Vertex-parity chromatic index; Weak vertex-parity edge-coloring; Vertex signature (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0178-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:35:y:2018:i:2:d:10.1007_s10878-017-0178-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0178-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().