[HTML][HTML] Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - European Journal of Combinatorics, 2012 - Elsevier
Given a graph G with maximum degree Δ≥ 3, we prove that the acyclic edge chromatic
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Δ− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Δ− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - arXiv, 2010 - dml.mathdoc.fr
Given a graph $ G $ with maximum degree $\Delta\ge 3$, we prove that the acyclic edge
chromatic number $ a'(G) $ of $ G $ is such that $ a'(G)\le\lceil 9.62 (\Delta-1)\rceil …
chromatic number $ a'(G) $ of $ G $ is such that $ a'(G)\le\lceil 9.62 (\Delta-1)\rceil …
Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - arXiv e-prints, 2010 - ui.adsabs.harvard.edu
Given a graph $ G $ with maximum degree $\Delta\ge 3$, we prove that the acyclic edge
chromatic number $ a'(G) $ of $ G $ is such that $ a'(G)\le\lceil 9.62 (\Delta-1)\rceil …
chromatic number $ a'(G) $ of $ G $ is such that $ a'(G)\le\lceil 9.62 (\Delta-1)\rceil …
Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - 2012 - dl.acm.org
Given a graph G with maximum degree Δ≥ 3, we prove that the acyclic edge chromatic
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Δ− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Δ− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - EUROPEAN JOURNAL OF …, 2012 - art.torvergata.it
Given a graph G with maximum degree Delta≥ 3, we prove that the acyclic edge chromatic
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Delta− 1)⌉. Moreover we prove that …
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Delta− 1)⌉. Moreover we prove that …
[PDF][PDF] Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - arXiv preprint arXiv:1005.1875, 2010 - Citeseer
Given a graph G with maximum degree∆≥ 3, we prove that the acyclic edge chromatic
number a′(G) of G is such that a′(G)≤⌈ 9.62 (∆− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
number a′(G) of G is such that a′(G)≤⌈ 9.62 (∆− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
[PDF][PDF] Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - arXiv preprint arXiv …, 2010 - researchgate.net
Given a graph G with maximum degree∆, we prove that the acyclic edge chromatic number
a′(G) of G is such that a′(G)≤ 9.62∆. Moreover we prove that a′(G)≤ 6.3∆ if G has girth …
a′(G) of G is such that a′(G)≤ 9.62∆. Moreover we prove that a′(G)≤ 6.3∆ if G has girth …
[引用][C] Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - European Journal of Combinatorics, 2012 - cir.nii.ac.jp
Improved bounds on coloring of graphs | CiNii Research CiNii 国立情報学研究所 学術情報
ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本をさがす …
ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本をさがす …
[PDF][PDF] Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - arXiv preprint arXiv:1005.1875, 2010 - academia.edu
Given a graph G with maximum degree∆≥ 3, we prove that the acyclic edge chromatic
number a′(G) of G is such that a′(G)≤⌈ 9.62 (∆− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
number a′(G) of G is such that a′(G)≤⌈ 9.62 (∆− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
Improved bounds on coloring of graphs
S Ndreca, A Procacci, B Scoppola - European Journal of Combinatorics, 2012 - infona.pl
Given a graph G with maximum degree Δ≥ 3, we prove that the acyclic edge chromatic
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Δ− 1)⌉. Moreover we prove that: a′(G)≤⌈ …
number a′(G) of G is such that a′(G)≤⌈ 9.62 (Δ− 1)⌉. Moreover we prove that: a′(G)≤⌈ …