An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (Q1043651): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Bounds for the Independence Number of Critical Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Independent sets and 2‐factors in edge‐chromatic‐critical graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 25 pretty graph colouring problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The size of edge chromatic critical graphs with maximum degree 6 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A note on Vizing's independence number conjecture of edge chromatic critical graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5558480 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5564127 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4517442 / rank | |||
Normal rank | |||
Revision as of 06:16, 2 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs |
scientific article |
Statements
An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs (English)
0 references
9 December 2009
0 references
edge coloring
0 references
independence number
0 references
critical graphs
0 references
