Strong edge-coloring for cubic Halin graphs (Q408187): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Gerard Jennhwa Chang / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2012.01.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1966127312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of a cubic graph is at most 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence and strong edge colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring of graphs with maximum degree 4 using 22 colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results in combinatorial analysis and graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216671 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3201075 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of strong edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: The incidence coloring conjecture for graphs of maximum degree 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for strong edge coloring of partial \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3423984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of complete cubic Halin graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of a class of graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:28, 5 July 2024

scientific article
Language Label Description Also known as
English
Strong edge-coloring for cubic Halin graphs
scientific article

    Statements

    Identifiers