Combinatorial spectra using polynomials.

DOI10.5817/AM2025-4-151MaRDI QIDQ6855444zbMATH OpenFDO

Authors Sylwia Cichacz-Przenioslo, Martin Dzúrik

Publication date 20 February 2026

Published in Archivum Mathematicum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5817/AM2025-4-151

zbMATH Keywords

1-2-3 labelingantimagiccoloringcombinatorial spectradominationgraphgraph theoryHamiltonian spectra

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)

Cites work

• A new upper bound for the irregularity strength of graphs
• A solution to the 1-2-3 conjecture
• An upper bound of a generalized upper Hamiltonian number of a graph
• Combinatorial Nullstellensatz
• Combinatorial Nullstellensatz
• Degree constrained subgraphs
• Dense graphs are antimagic
• Edge roman domination in graphs
• Edge weights and vertex colours
• scientific article; zbMATH DE number 4097437 (Why is no real title available?)
• scientific article; zbMATH DE number 728185 (Why is no real title available?)
• scientific article; zbMATH DE number 2109324 (Why is no real title available?)
• Irregular Assignments of Trees and Forests
• Irregularity strength of trees
• On Hamiltonian Walks in Graphs
• On vertex-coloring 13-edge-weighting
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Vertex-coloring graphs with 4-edge-weightings
• Vertex-colouring edge-weightings

This page was built for publication: Combinatorial spectra using polynomials.

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