Some new characterizations of graph colorability and of blocking sets of projective spaces

MaRDI QIDQ405185zbMATH OpenFDO

Authors Uwe Schauz

Publication date 4 September 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p3

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph coloringblocking setsswitching games

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Blocking sets, ovals, (k)-arcs (51E21) Combinatorial games (91A46)

Recommendations

• On the chromatic index of a finite projective space
• Remarks on odd colorings of graphs
• Colorings with neighborhood parity condition
• On line colorings of finite projective spaces
• Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game

Cites work

• Algebraically solvable problems: describing polynomials as equivalent to explicit solutions
• Anti-codes in terms of Berlekamp's switching game
• Colorings and nowhere-zero flows of graphs in terms of Berlekamp's switching game
• On the Interpretation of Whitney Numbers Through Arrangements of Hyperplanes, Zonotopes, Non-Radon Partitions, and Orientations of Graphs
• Sinks in acyclic orientations of graphs

This page was built for publication: Some new characterizations of graph colorability and of blocking sets of projective spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405185)