Acyclic matchings in graphs of bounded maximum degree
Sign Up to like & getrecommendations! Published in 2022 at "Discrete Mathematics"
DOI: 10.1016/j.disc.2022.112885
Abstract: A matching $M$ in a graph $G$ is acyclic if the subgraph of $G$ induced by the set of vertices that are incident to an edge in $M$ is a forest. We prove that every… read more here.
Keywords: maximum degree; acyclic matchings; graphs bounded; bounded maximum ... See more keywords
Isomorphism, canonization, and definability for graphs of bounded rank width
Sign Up to like & getrecommendations! Published in 2021 at "Communications of the ACM"
DOI: 10.1145/3453943
Abstract: We investigate the interplay between the graph isomorphism problem, logical definability, and structural graph theory on a rich family of dense graph classes: graph classes of bounded rank width. We prove that the combinatorial Weisfeiler-Leman… read more here.
Keywords: bounded rank; isomorphism; graphs bounded; rank width ... See more keywords