scientific article; zbMATH DE number 821271

Publication date: 28 November 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

graph coloring planar graphs hypergraphs flows perfect graphs critical graphs harmonious chromatic number orientations game chromatic number degrees chromatic polynomials sparse graphs edge colorings list-coloring combinatorial graphs chromatic graphs conjectures of Hadwiger

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (only showing first 100 items - show all)

Improved bound for improper colourings of graphs with no odd clique minor ⋮ A new 4-chromatic edge critical Koester graph ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ A note on $\Delta$-critical graphs ⋮ A note on Reed's conjecture for triangle-free graphs ⋮ A $(2, 1)$-decomposition of planar graphs without intersecting 3-cycles and adjacent $4^-$-cycles ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Solving combinatorial optimisation problems using oscillator based Ising machines ⋮ Decompositions of graphs of nonnegative characteristic with some forbidden subgraphs ⋮ Minimum gradation in greyscales of graphs ⋮ Hardness transitions and uniqueness of acyclic colouring ⋮ The Alon-Tarsi number of two kinds of planar graphs ⋮ Unnamed Item ⋮ Extensions and reductions of squarefree words ⋮ Chromatic numbers of Cayley graphs of abelian groups: a matrix method ⋮ On the Alon-Tarsi number of semi-strong product of graphs ⋮ On triangle-free list assignments ⋮ Edge-colouring graphs with local list sizes ⋮ Schnyder woods and Alon-Tarsi number of planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A note on interval colourings of graphs ⋮ Proper conflict-free coloring of sparse graphs ⋮ Strong Turán stability ⋮ A note on δ^(k)-colouring of the Cartesian product of some graphs ⋮ On the hardness of allocating frequencies for hybrid networks ⋮ Results on Grundy chromatic number of join graph of graphs ⋮ Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions ⋮ Frozen development in graph coloring ⋮ Hadwiger's conjecture and topological bounds ⋮ Brooks-type theorems for relaxations of square colorings ⋮ LexBFS-orderings and powers of graphs ⋮ Group coloring and group connectivity with non-isomorphic groups of the same order ⋮ Nowhere-zero 3-flows in signed planar graphs ⋮ Labeling trees with a condition at distance two ⋮ Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring ⋮ Minimum partition into plane subgraphs: the CG:SHOP challenge 2022 ⋮ Edge 4-critical Koester graph of order 28 ⋮ A note on Alon-Tarsi number of Halin graphs ⋮ Discrete geometry. Abstracts from the workshop held January 21--26, 2024 ⋮ The split and non-split tree $(D, C)$-number of a graph ⋮ Asymptotically good local list edge colourings ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ On the maximum number of edges in $k$-critical graphs ⋮ Relaxing the irrevocability requirement for online graph algorithms ⋮ A characterization of star-perfect graphs ⋮ Graph coloring and semidefinite rank ⋮ On two problems of defective choosability of graphs ⋮ The Alon-Tarsi number of cupolarotundas and gyroelongated rotunda ⋮ Colouring graphs of bounded diameter in the absence of small cycles ⋮ Claw‐decompositions and tutte‐orientations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs ⋮ Parameterized Pre-Coloring Extension and List Coloring Problems ⋮ Unnamed Item ⋮ A brief history of edge-colorings – with personal reminiscences ⋮ On b-coloring of central graph of some graphs ⋮ Maximum bipartite subgraphs in $H$-free graphs ⋮ The incidentor coloring of multigraphs and its applications ⋮ A note on the minimum number of choosability of planar graphs ⋮ Total coloring of planar graphs without chordal 7-cycles ⋮ List-edge-colouring planar graphs with precoloured edges ⋮ Thinness of product graphs ⋮ A note on total and list edge-colouring of graphs of tree-width 3 ⋮ The Alon-Tarsi number of planar graphs ⋮ Dynamic $F$-free coloring of graphs ⋮ Three-coloring planar graphs without short cycles ⋮ The tournament scheduling problem with absences ⋮ On the $d$-distance face chromatic number of plane graphs ⋮ List edge and list total coloring of planar graphs with maximum degree 8 ⋮ The number of $k$-colorings of a graph on a fixed surface ⋮ Solving graph coloring problems with the Douglas-Rachford algorithm ⋮ Hamiltonicity and colorings of arrangement graphs ⋮ Hamiltonian cycles in critical graphs with large maximum degree ⋮ Steinberg's conjecture is false ⋮ The number of colorings of planar graphs with no separating triangles ⋮ Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles ⋮ The equivalence number of a line graph ⋮ Modularity-based decompositions for valued CSP ⋮ Color-critical graphs on a fixed surface ⋮ A note on graph colorings and graph polynomials ⋮ Group connectivity of bridged graphs ⋮ Graph factors and factorization: 1985--2003: a survey ⋮ Online multi-coloring on the path revisited ⋮ Partitions of graphs into cographs ⋮ $L(2,1)$-labelings on the modular product of two graphs ⋮ NP-completeness of local colorings of graphs ⋮ Total coloring of embedded graphs with maximum degree at least seven ⋮ The square of a planar cubic graph is 7-colorable ⋮ ($1,1,0$)-coloring of planar graphs without cycles of length 4 and 6 ⋮ Cellular adaptive Petri net based on learning automata and its application to the vertex coloring problem ⋮ Spanning quadrangulations of triangulated surfaces ⋮ Packing six $T$-joins in plane graphs ⋮ On the edge-density of 4-critical graphs ⋮ On indicated coloring of graphs ⋮ Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs ⋮ Parity vertex colouring of plane graphs

This page was built for publication: