Abstract
AbstractAndreae proved that the cop number of connected ‐minor‐free graphs is bounded for every graph . In particular, the cop number is at most if contains no isolated vertex, where . The main result of this paper is an improvement on this bound, which is most significant when is small or sparse, for instance, when can be obtained from another graph by multiple edge subdivisions. Some consequences of this result are improvements on the upper bound for the cop number of ‐minor‐free graphs, ‐minor‐free graphs and linklessly embeddable graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
