KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963358977 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1408.1973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measurable chromatic and independence numbers for ergodic graphs and group actions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552634 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost of equivalence relations and groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse graphs: Metrics and random models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mercuriale de groupes et de relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof for a generalization of Vizing's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recurrence of distributional limits of finite planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Processes on unimodular random networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration for Independent Permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A determinacy approach to Borel combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings as IID factors on non-amenable groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4043282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cost of generating an equivalence relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel chromatic numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in orbit equivalence / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Borel oracles. An analytical approach to constant-time algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits of locally-globally convergent graph sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On limits of finite graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:44, 13 July 2024

scientific article
Language Label Description Also known as
English
KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS
scientific article

    Statements

    KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Vizing's theorem
    0 references
    bounded-degree graph
    0 references
    0 references
    0 references