Login / Signup

Constructing infinitely many half-arc-transitive covers of tetravalent graphs.

Pablo SpigaBinzhou Xia
Published in: J. Comb. Theory, Ser. A (2021)
Keyphrases
  • finite number
  • directed graph
  • graph matching
  • connected components
  • bipartite graph
  • graph theory
  • graph clustering
  • database
  • pattern recognition
  • graph databases
  • graph theoretic
  • series parallel