Note on incidence chromatic number of subquartic graphs

Petr Gregor (), Borut Lužar () and Roman Soták ()
Additional contact information
Petr Gregor: Charles University
Borut Lužar: Faculty of Information Studies
Roman Soták: Pavol Jozef Šafárik University

Journal of Combinatorial Optimization, 2017, vol. 34, issue 1, No 11, 174-181

Abstract: Abstract An incidence in a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident to v. Two incidences (v, e) and (u, f) are adjacent if at least one of the following holds: $$(a) v = u, (b) e = f$$ ( a ) v = u , ( b ) e = f , or $$(c) vu \in \{e,f\}$$ ( c ) v u ∈ { e , f } . An incidence coloring of G is a coloring of its incidences assigning distinct colors to adjacent incidences. In this note we prove that every subquartic graph admits an incidence coloring with at most seven colors.

Keywords: Incidence coloring; Subquartic graph; Incidence chromatic number (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0072-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:34:y:2017:i:1:d:10.1007_s10878-016-0072-2

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0072-2

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().