The cordiality game and the game cordiality number

DOI10.1007/s00373-024-02798-1zbMATH Open1544.05069MaRDI QIDQ6580492

Michael C. Wigal, Elliot Krop, Aryan Mittal

Publication date: 29 July 2024

Published in: Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

treescordial labelingcordiality gamegame cordiality number

Mathematics Subject Classification ID

Trees (05C05) Games involving graphs (91A43) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Games on graphs (graph-theoretic aspects) (05C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Cordial labeling of hypertrees
• A-cordial graphs
• On the complexity of some two-person perfect-information games
• Graph searching and a min-max theorem for tree-width
• On some graph-cordial abelian groups
• Positional games
• Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game
• Colouring games
• Domination Game and an Imagination Strategy
• Domination Game: A proof of the $3/5$-Conjecture for Graphs with Minimum Degree at Least Two
• On Additive Bases and Harmonious Graphs
• Biased Positional Games
• Positional Games
• Generalized graph cordiality
• Path-cordial abelian groups
• All trees are six-cordial
• Statistical Mechanics of Lattice Systems
• Extremal Problems for Game Domination Number
• The Map-Coloring Game
• Domination Games Played on Graphs
• 6-uniform Maker-Breaker game is PSPACE-complete

This page was built for publication: The cordiality game and the game cordiality number

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