DOIAbstract
AbstractWe provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of parameters related to the expansion of a graph) in terms of forbidden subdivisions
AbstractWe provide a characterization of several graph parameters (the acyclic chromatic number, the arrangeability, and a sequence of parameters related to the expansion of a graph) in terms of forbidden subdivisions
The central theme of this thesis is the study of the properties of the classes of graphs defined by ...
For a class C of graphs, we define C-edge-brittleness of a graph G as the minimum ℓ such that the ve...
AbstractWe define a parameter which measures the proportion of vertices which must be removed from a...
AbstractWe provide a characterization of several graph parameters (the acyclic chromatic number, the...
AbstractFor various graph-theoretic properties P that impose upper bounds on the minimum degree or t...
Celem pracy jest scharakteryzowanie klas grafów, które można zdefiniować za pomocą małych struktur z...
AbstractWe define classes of graphs based on forbidding and enforcing boundary conditions. Forbiddin...
Let G be a graph with chromatic number χ (G). A vertex colouring of G is \emphacyclic if each bichro...
Let G be a graph with chromatic number χ(G). A vertex colouring of G is acyclic if each bichromatic ...
Click on the link to view the abstract.Keywords: Generalised colouring, forbidden subgraph, graph pr...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
AbstractThe conditional chromatic numberx(G, P) of a graph G with respect to a graphical property P ...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
Let k be an integer. A graph G is k-arrangeable (concept introduced by Chen and Schelp) if the verti...
The central theme of this thesis is the study of the properties of the classes of graphs defined by ...
For a class C of graphs, we define C-edge-brittleness of a graph G as the minimum ℓ such that the ve...
AbstractWe define a parameter which measures the proportion of vertices which must be removed from a...
AbstractWe provide a characterization of several graph parameters (the acyclic chromatic number, the...
AbstractFor various graph-theoretic properties P that impose upper bounds on the minimum degree or t...
Celem pracy jest scharakteryzowanie klas grafów, które można zdefiniować za pomocą małych struktur z...
AbstractWe define classes of graphs based on forbidding and enforcing boundary conditions. Forbiddin...
Let G be a graph with chromatic number χ (G). A vertex colouring of G is \emphacyclic if each bichro...
Let G be a graph with chromatic number χ(G). A vertex colouring of G is acyclic if each bichromatic ...
Click on the link to view the abstract.Keywords: Generalised colouring, forbidden subgraph, graph pr...
Considering the partitions of a set into nonempty subsets, we obtain an expression for the number of...
AbstractThe conditional chromatic numberx(G, P) of a graph G with respect to a graphical property P ...
AbstractIn this paper we have investigated mainly the three colouring parameters of a graph G, viz.,...
We provide a finite forbidden induced subgraph characterization for the graph class gamma(k), for al...
Let k be an integer. A graph G is k-arrangeable (concept introduced by Chen and Schelp) if the verti...
The central theme of this thesis is the study of the properties of the classes of graphs defined by ...
For a class C of graphs, we define C-edge-brittleness of a graph G as the minimum ℓ such that the ve...
AbstractWe define a parameter which measures the proportion of vertices which must be removed from a...
Add to ORKG