Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082): 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1942599361 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1412.2624 / 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: Graph Bipartization and via minimization / 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: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on the strong chromatic index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the strong chromatic index of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced matchings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 20:45, 10 July 2024

scientific article
Language Label Description Also known as
English
Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
scientific article

    Statements

    Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    8 October 2015
    0 references
    strong edge-coloring
    0 references
    bipartite graphs
    0 references
    complexity
    0 references

    Identifiers