Some criteria for a graph to be class 1 (Q442377): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2011.09.035 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969717359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On small graphs critical with respect to edge colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic-index-critical graphs of orders 13 and 14 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic-index-critical graphs of orders 11 and 12 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring the petals of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\Delta\)-subgraph condition for a graph to be class 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-factorizing regular graphs of high degree - an improved bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5184931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Vizing's adjacency lemma of edge chromatic critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sufficient Condition for a Graph to be the Core of a Class 2 Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3853641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181716 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two conjectures on edge-colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for a regular graph to be class 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of a graph whose core has maximum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of class II graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles through vertices of large maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic index critical graphs of even order with five major vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank

Latest revision as of 13:46, 5 July 2024

scientific article
Language Label Description Also known as
English
Some criteria for a graph to be class 1
scientific article

    Statements

    Some criteria for a graph to be class 1 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 August 2012
    0 references
    0 references
    edge coloring
    0 references
    core
    0 references
    class 1
    0 references
    unicyclic
    0 references
    0 references