\(H\)-colorings for 4-regular graphs

DOI10.1016/j.disc.2023.113844zbMath1530.05054OpenAlexW4389990943MaRDI QIDQ6177438

Kenta Ozeki, Analen Malnegro

Publication date: 17 January 2024

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2023.113844

zbMATH Keywords

line graph4-regular graph\(H\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On even cycle decompositions of 4-regular line graphs
• Even cycle decompositions of 4-regular graphs and line graphs
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Even circuits in planar graphs
• Colouring of cubic graphs by Steiner triple systems
• Minimum number of palettes in edge colorings
• Even cycle decompositions of index 3 by a novel coloring technique
• On 4-connected 4-regular graphs without even cycle decompositions
• Even cycles and even 2-factors in the line graph of a simple graph
• Projective, affine, and abelian colorings of cubic graphs
• Edge-colorings of 4-regular graphs with the minimum number of palettes
• Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
• A remark on Petersen coloring conjecture of Jaeger
• Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems
• An equivalent formulation of the Fan-Raspaud Conjecture and related problems
• S_12 and P_12-colorings of cubic graphs
• On the existence of graphs which can colour every regular graph

This page was built for publication: \(H\)-colorings for 4-regular graphs