Induced matchings in cubic graphs
From MaRDI portal
Publication:4693353
Recommendations
Cites work
Cited in
(only showing first 100 items - show all)- On the rich-neighbor edge-colorings of subcubic graphs
- Fractional strong chromatic index of bipartite graphs
- Strong edge-colorings of sparse graphs with large maximum degree
- On strong chromatic index of some operations on graphs
- Strong edge coloring of Cayley graphs and some product graphs
- Induced matchings in subcubic graphs without short cycles
- On strong list edge coloring of subcubic graphs
- On the strong chromatic index of cubic Halin graphs
- Algorithms for finding an independent \(\{K_1,K_2\}\)-packing of maximum weight in a graph
- A note on strong edge-coloring of claw-free cubic graphs
- A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs
- Strong edge-coloring for cubic Halin graphs
- List strong edge coloring of planar graphs with maximum degree 4
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable
- The strong clique index of a graph with forbidden cycles
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- Strong chromatic index of sparse graphs with maximum degree 4
- Strong chromatic index of sparse graphs
- Independent packings in structured graphs
- On strong edge-coloring of claw-free subcubic graphs
- The strong chromatic index of complete cubic Halin graphs
- Strong edge-coloring of subcubic planar graphs
- Minimum maximal matchings in cubic graphs
- Strong chromatic index of claw-free graphs with edge weight seven
- On induced subgraphs of the cube
- Maximum induced matchings of random cubic graphs
- On the precise value of the strong chromatic index of a planar graph with a large girth
- From edge-coloring to strong edge-coloring
- scientific article; zbMATH DE number 1916558 (Why is no real title available?)
- List strong edge-coloring of graphs with maximum degree 4
- A lower bound on the acyclic matching number of subcubic graphs
- Induced matchings in graphs of degree at most 4
- Squared chromatic number without claws or large cliques
- Degenerate matchings and edge colorings
- Incidence and strong edge colorings of graphs
- A bound on the strong chromatic index of a graph
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs
- Strong edge coloring of subquartic graphs
- Proper edge-colorings with a rich neighbor requirement
- Strong cliques in claw-free graphs
- The strong chromatic index of Halin graphs
- The strong chromatic index of 1-planar graphs
- Proof of a conjecture on the strong chromatic index of Halin graphs
- Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable
- On strong edge-coloring of graphs with maximum degree 5
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
- Degree conditions of induced matching extendable graphs
- On isomorphic linear partitions in cubic graphs
- On isomorphic linear partitions in cubic graphs
- A stronger bound for the strong chromatic index (extended abstract)
- On strong edge-colouring of subcubic graphs
- Variations on the Petersen colouring conjecture
- Strong edge-colouring of sparse planar graphs
- Strong chromatic index of planar graphs with large girth
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- Induced matchings in asteroidal triple-free graphs
- On an induced version of Menger's theorem
- A note on the strong chromatic index of bipartite graphs
- Brambles and independent packings in chordal graphs
- The strong chromatic index of a class of graphs
- The strong edge-coloring for graphs with small edge weight
- Strong edge-coloring of pseudo-Halin graphs
- On the strong chromatic index of cyclic multigraphs
- On semistrong edge-colorings of outerplanar graphs
- Strong edge chromatic index of the generalized Petersen graphs
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- On distance-3 matchings and induced matchings
- Strong list-chromatic index of planar graphs with Ore-degree at most seven
- Strong edge-coloring of graphs with maximum edge weight seven
- Strong edge-coloring of cubic bipartite graphs: a counterexample
- List strong edge-colorings of sparse graphs
- Strong chromatic index of \(K_{1, t}\)-free graphs
- Odd graph and its applications to the strong edge coloring
- List strong and list normal edge-coloring of (sub)cubic graphs
- On strong edge-coloring of graphs with maximum degree 4
- Strong edge-coloring of planar graphs
- Strong edge-coloring of planar graphs
- On distance-3 matchings and induced matchings
- From light edges to strong edge-colouring of 1-planar graphs
- Strong edge-colorings for \(k\)-degenerate graphs
- Strong chromatic index of subcubic planar multigraphs
- Upper bounds for the strong chromatic index of Halin graphs
- A note on strong edge coloring of sparse graphs
- Strong edge-coloring for jellyfish graphs
- Strong chromatic index of K₄-minor free graphs
- Between proper and strong edge‐colorings of subcubic graphs
- On the rich-neighbor edge-coloring of sparse graphs
- Recent progress on strong edge-coloring of graphs
- On \((s,t)\)-relaxed strong edge-coloring of graphs
- A stronger bound for the strong chromatic index
- Strong chromatic index of graphs with maximum degree four
- Problems on cycles and colorings
- Strong edge-coloring of 2-degenerate graphs
- Strong edge colorings of graphs and the covers of Kneser graphs
- A note on strong edge choosability of toroidal subcubic graphs
- Strong edge-coloring of some sparse graphs
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
- Approximating maximum uniquely restricted matchings in bipartite graphs
- The tight bound for the strong chromatic indices of claw-free subcubic graphs
This page was built for publication: Induced matchings in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4693353)
