The Alcuin number of graphs with maximum degree five

DOI10.1360/N012013-00166MaRDI QIDQ5017963zbMATH OpenOpenAlexFDO

Authors Erfang Shan, Lu Kong, Liying Kang

Publication date 17 December 2021

Published in SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1360/n012013-00166

zbMATH Keywords

independent setvertex covercover numberAlcuin number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Some new results in the Alcuin number of graphs
• Graphs with maximum degreee 5 are acyclically 7-colorable
• The Alcuin Number of a Graph and Its Connections to the Vertex Cover Number
• The Alcuin number of a graph and its connections to the vertex cover number
• Acyclic coloring of graphs of maximum degree \(\Delta \)

Cited in

(6)

• scientific article; zbMATH DE number 861311 (Why is no real title available?)
• The ferry cover problem on regular graphs and small-degree graphs
• Altitude of regular graphs with girth at least five
• Some new results in the Alcuin number of graphs
• Q-integral graphs with edge-degrees at most five
• scientific article; zbMATH DE number 6837048 (Why is no real title available?)

This page was built for publication: The Alcuin number of graphs with maximum degree five

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