Degenerate matchings and edge colorings (Q1706114): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2586268872 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1702.02358 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced degenerate subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large induced forests in sparse graphs / 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: Uniquely restricted matchings and edge colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529530 / 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: The graphs with maximum induced matching and maximum matching the same size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum induced matchings close to maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely Restricted Matchings in Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets in cubic multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized subgraph-restricted matchings in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely restricted matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in subcubic graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Subcubic Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on AT-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the feedback vertex set problem in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: A linear-time algorithm for the weighted feedback vertex problem on interval 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: ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two greedy consequences for maximum induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-completeness of some generalizations of the maximum matching problem / rank
 
Normal rank

Latest revision as of 08:01, 15 July 2024

scientific article
Language Label Description Also known as
English
Degenerate matchings and edge colorings
scientific article

    Statements

    Degenerate matchings and edge colorings (English)
    0 references
    0 references
    0 references
    21 March 2018
    0 references
    matching
    0 references
    edge coloring
    0 references
    induced matching
    0 references
    acyclic matching
    0 references
    uniquely restricted matching
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers