On incidence coloring conjecture in Cartesian products of graphs

Petr Gregor; Borut Lužar; Roman Soták

doi:10.1016/j.dam.2016.04.030

ScienceGate Book Chapters

JOURNAL ARTICLE

On incidence coloring conjecture in Cartesian products of graphs

Petr Gregor Borut Lužar Roman Soták

Year: 2016 Journal: Discrete Applied Mathematics Vol: 213 Pages: 93-100 Publisher: Elsevier BV

DOI: 10.1016/j.dam.2016.04.030

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Cartesian product Mathematics Edge coloring Conjecture Graph coloring Brooks' theorem Vertex (graph theory) Incidence (geometry) Complete coloring Graph Discrete mathematics 1-planar graph Chordal graph Graph power Line graph

Metrics

Cited By

1.50

FWCI (Field Weighted Citation Impact)

Refs

0.88

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

On incidence coloring conjecture in Cartesian products of graphs

Metrics

Citation History

Topics

Related Documents

Incidence coloring of Cartesian product graphs

DP‐coloring Cartesian products of graphs

List coloring of Cartesian products of graphs

Indicated coloring game on Cartesian products of graphs

Fuzzy incidence coloring on cartesian product of some fuzzy incidence graphs