Projective, affine, and abelian colorings of cubic graphs

DOI10.1016/j.ejc.2007.11.029zbMath1198.05019OpenAlexW2031373750WikidataQ57601475 ScholiaQ57601475MaRDI QIDQ2519796

Ondřej Pangrác, Daniel Král', Edita Máčajová, Jean-Sébastien Sereni, Martin Škoviera, Andre Raspaud

Publication date: 27 January 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.029

Mathematics Subject Classification ID

Finite affine and projective planes (geometric aspects) (51E15) Coloring of graphs and hypergraphs (05C15) Triple systems (05B07)

Related Items (13)

Sparsely intersecting perfect matchings in cubic graphs ⋮ Cores, joins and the Fano-flow conjectures ⋮ Deciding whether four perfect matchings can cover the edges of a snark is NP-complete ⋮ \(H\)-colorings for 4-regular graphs ⋮ Reduction of the Berge-Fulkerson conjecture to cyclically 5-edge-connected snarks ⋮ An equivalent formulation of the Fan-Raspaud Conjecture and related problems ⋮ Unnamed Item ⋮ Partially normal 5-edge-colorings of cubic graphs ⋮ Cubic graphs that cannot be covered with four perfect matchings ⋮ Short cycle covers of graphs and nowhere-zero flows ⋮ Wilson-Schreiber Colourings of Cubic Graphs ⋮ On a Conjecture of Fan and Raspaud ⋮ Coloring Cubic Graphs by Point-Intransitive Steiner Triple Systems

Cites Work

• Configurations and graphs
• Shortest coverings of graphs with cycles
• Fano colourings of cubic graphs and the Fulkerson conjecture
• Flows and generalized coloring theorems in graphs
• Fulkerson's conjecture and circuit covers
• Configurations and their realization
• Colouring of cubic graphs by Steiner triple systems
• Counting symmetric configurations \(v_3\)
• Small triangle-free configurations of points and lines
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• Abelian Colourings of Cubic Graphs
• Unions of perfect matchings in cubic graphs
• Non-intersecting perfect matchings in cubic graphs (Extended abstract)
• The NP-Completeness of Edge-Coloring
• Almost all cubic graphs are Hamiltonian
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
• Blocking and anti-blocking pairs of polyhedra
• Self-dual configurations and regular graphs
• On cycle-double covers of graphs of small oddness
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Projective, affine, and abelian colorings of cubic graphs