Path Saturation Game on Six Vertices

DOI10.1007/S00373-024-02767-8MaRDI QIDQ6489356FDOQ6489356

Authors: Paul Balister, Ali Dogan 

Publication date: 21 April 2024

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43)

Cites Work

• Saturated graphs with minimal number of edges
• A Problem in Graph Theory
• Game matching number of graphs
• \(\mathcal{F}\)-saturation games
• The edge spectrum of the saturation number for small paths
• The Game Saturation Number of a Graph
• An upper bound on the extremal version of Hajnal's triangle-free game
• On an extremal problem in graph theory.
• On Hajnal's triangle-free game

This page was built for publication: Path Saturation Game on Six Vertices

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