Forbidden structures for planar perfect consecutively colourable graphs
Copyright policy )Forbidden structures for planar perfect consecutively colourable graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Zielona Góra Poland
consecutive (interval) colouring, Extremal problems in graph theory, Sevastjanov graph, forbidden graph, interval colouring, consecutive colouring, deficiency, Planar graphs; geometric and topological aspects of graph theory, edge colouring, Coloring of graphs and hypergraphs, QA1-939, sevastjanov graph, Structural characterization of families of graphs, Mathematics
consecutive (interval) colouring, Extremal problems in graph theory, Sevastjanov graph, forbidden graph, interval colouring, consecutive colouring, deficiency, Planar graphs; geometric and topological aspects of graph theory, edge colouring, Coloring of graphs and hypergraphs, QA1-939, sevastjanov graph, Structural characterization of families of graphs, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!