Object

Title: On the Existence of Bipartite Graphs Which are notCyclically-Interval Colorable

Abstract:

A proper edge t-coloring of an undirected, simple, finite, connected graph G is a coloring of its edges with colors 1, 2, ..., t such that all colors are used, and no two adjacent edges receive the same color. A cyclically interval t-coloring of a graph G is a proper edge t-coloring of G such that for each its vertex x, either the set of colors used on edges incident to x or the set of colors not used on edges incident to x forms an interval of integers. For any t ∈ N, let Mt be the set of graphs for which there exists a cyclically-interval t-coloring. Examples of bipartite graphs that do not belong to the class S t≥1 Mt are constructed.

Identifier:

oai:noad.sci.am:135802

Language:

English

URL:

click here to follow the link

Additional Information:

rrkamalian@yahoo.com

Affiliation:

Institute for Informatics and Automation Problems

Country:

Armenia

Year:

2017

Time period:

September25-29

Conference title:

11th International Conference on Computer Science and Information Technologies CSIT 2017

Place:

Yerevan

Participation type:

oral

Object collections:

Last modified:

Mar 3, 2021

In our library since:

Jul 16, 2020

Number of object content hits:

8

All available object's versions:

https://noad.sci.am/publication/149329

Show description in RDF format:

RDF

Show description in OAI-PMH format:

OAI-PMH

This page uses 'cookies'. More information