Recent progress on strong edge-coloring of graphs (Q5242836): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q114978410 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Squared Chromatic Number Without Claws or Large Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge coloring sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-colouring of sparse planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring graphs with sparse neighbourhoods: bounds and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precise upper bound for the strong edge chromatic number of sparse planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The induced matching and chain subgraph cover problems for convex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum induced matchings for chordal graphs in linear time / 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: A stronger bound for the strong chromatic index (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in intersection graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum induced matching in weakly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in asteroidal triple-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring for jellyfish graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the precise value of the strong chromatic index of a planar graph with a large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong chromatic index of planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Chromatic Index of 2-Degenerate Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring for planar graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-colorings of sparse graphs with large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree / 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: Strong list-chromatic index of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a topological relaxation of a conjecture of Erdős and Nešetřil / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional strong chromatic index of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong chromatic index of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of the maximum induced matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the clique number of the square of a line graph and its relation to maximum degree of the line graph / 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: The Strong Chromatic Index of Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irredundancy in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On incidence coloring and star arboricity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong edge-colouring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge colouring of subcubic graphs / 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: Strong chromatic index of graphs with maximum degree four / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of \((3,\Delta)\)-bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Graphs of Bounded Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Graphs of Degree at Most 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong chromatic index of subcubic planar multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximum induced matchings in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong edge-coloring of graphs with maximum degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong list edge coloring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index ofC4-free 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 bound on the strong chromatic index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colouring and the probabilistic method / 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: List strong edge coloring of some classes of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs of maximum degree seven are Class I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique number of the square of a line graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring squares of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong chromatic index of \(k\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd graph and its applications to the strong edge coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar graphs with maximum degree 4 are strongly 19-edge-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong chromatic index of a class of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-colorings for \(k\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph with maximum degree 7 is of class 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong list edge coloring of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4944970 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:05, 20 July 2024

scientific article; zbMATH DE number 7127635
Language Label Description Also known as
English
Recent progress on strong edge-coloring of graphs
scientific article; zbMATH DE number 7127635

    Statements

    Recent progress on strong edge-coloring of graphs (English)
    0 references
    0 references
    0 references
    0 references
    7 November 2019
    0 references
    strong edge-coloring
    0 references
    strong chromatic index
    0 references
    induced matching
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers