On the size of graphs of class 2 whose cores have maximum degree two (Q367049): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On small graphs critical with respect to edge colourings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Graphs of High Degree are 1-Factorizable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chromatic index critical graphs of order 9 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181716 / 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: 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: Q3147264 / 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: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5558480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2721338 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715121 / rank
 
Normal rank

Revision as of 21:44, 6 July 2024

scientific article
Language Label Description Also known as
English
On the size of graphs of class 2 whose cores have maximum degree two
scientific article

    Statements

    Identifiers