Distinguishing colorings, proper colorings, and covering properties without \textsf{AC}
From MaRDI portal
Publication:6619401
DOI10.26493/1855-3974.3233.185MaRDI QIDQ6619401
Amitayu Banerjee, Unnamed Author, Alexa Gopaulsingh
Publication date: 15 October 2024
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
axiom of choicemaximal matchingproper coloringsminimal dominating setdistinguishing coloringsminimal edge cover
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Axiom of choice and related propositions (03E25) Infinite graphs (05C63)
This page was built for publication: Distinguishing colorings, proper colorings, and covering properties without \textsf{AC}