scientific article; zbMATH DE number 1534644
From MaRDI portal
Publication:4517442
Recommendations
Cited in
(27)- The edge version of Hadwiger's conjecture
- Achieving maximum chromatic index in multigraphs
- An application of Vizing and Vizing-like adjacency lemmas to Vizing's independence number conjecture of edge chromatic critical graphs
- On Vizing's bound for the chromatic index of a multigraph
- Construction of class two graphs with maximum vertex degree three
- A note on \(n\)-edge chromatic number
- Short solution of Kotzig's problem for bipartite graphs
- Note on the game chromatic index of trees
- On the fg-coloring of graphs
- Further results on the deficiency of graphs
- The average degree of an edge-chromatic critical graph
- Interval cyclic edge-colorings of graphs
- Interval edge-colorings of complete graphs
- Strict coloring of incidentors in undirected multigraphs
- On the (p,q)-coloring of incidentors of an undirected multigraph
- scientific article; zbMATH DE number 5118955 (Why is no real title available?)
- scientific article; zbMATH DE number 1560508 (Why is no real title available?)
- scientific article; zbMATH DE number 2097444 (Why is no real title available?)
- An introduction to the discharging method via graph coloring
- On list incidentor \((k,l)\)-coloring
- A generalization of interval edge-colorings of graphs
- On resistance of graphs
- Coloring graphs from random lists
- Independence in 5-uniform hypergraphs
- The average degree of a multigraph critical with respect to edge or total choosability
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
- On disjoint matchings in cubic graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517442)
