2 papers
math.CO2025
Vertex-partitions of 2-edge-colored graphs
Jørgen Bang-Jensen, Francois Pirot, Anders Yeo
A {\bf -majority coloring} of a digraph is a coloring of with colors so that each vertex has at least as many out-neighbours of color differe…
math.CO2024
On graphs which have locally complete 2-edge-colourings and their relationship to proper circular-arc graphs
Jørgen Bang-Jensen, Jing Huang
A 2-edge-coloured graph is called {\bf locally complete} if for each vertex , the vertices adjacent to through edges of the same colour induce a complete subgraph in …