On boundaries of extrema of the number of vertices with an interval spectrum on the sets of proper edge t-colorings of some cubic graphs under variation of t
From MaRDI portal
Publication:5402066
DOI10.12988/IMF.2013.3491zbMATH Open1283.05089arXiv1410.7927OpenAlexW2514644668MaRDI QIDQ5402066FDOQ5402066
Authors: Narine N. Davtyan, Arpine M. Khachatryan, R. R. Kamalian
Publication date: 12 March 2014
Published in: International Mathematical Forum (Search for Journal in Brave)
Abstract: The sets of vertices and edges of an undirected, simple, finite, connected graph are denoted by and , respectively. An arbitrary nonempty finite subset of consecutive integers is called an interval. An injective mapping is called a labeling of the graph . If is a graph, is its arbitrary vertex, and is its arbitrary labeling, then the set } is called a spectrum of the vertex of the graph at its labeling . For any graph and its arbitrary labeling , a structure of the subgraph of , induced by the subset of vertices of with an interval spectrum, is described.
Full work available at URL: https://arxiv.org/abs/1410.7927
Recommendations
- Estimates for the number of vertices with an interval spectrum in proper edge colorings of some graphs
- On proper edge 3-colorings of a cubic graph
- Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
- A generalization of interval edge-colorings of graphs
- On one-sided interval edge colorings of biregular bipartite graphs
Cited In (3)
This page was built for publication: On boundaries of extrema of the number of vertices with an interval spectrum on the sets of proper edge \(t\)-colorings of some cubic graphs under variation of \(t\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402066)