On coloring parameters of triangle-free planar \((n, m)\)-graphs
DOI10.1007/S00373-024-02851-ZMaRDI QIDQ6640959
Sagnik Sen, Soumen Nandi, S. Taruni
Publication date: 20 November 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
graph homomorphismstriangle-free planar graphs\((n, m)\)-chromatic number\((n, m)\)-graphs\((n, m)\)-relative clique number
Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Homomorphisms and colourings of oriented graphs: an updated survey
- The relative oriented clique number of triangle-free planar graphs is 10
- Oriented colorings of triangle-free planar graphs
- Signed graphs
- Minimal oriented graphs of diameter 2
- Homomorphisms of edge-colored graphs and Coxeter groups
- Homomorphisms and oriented colorings of equivalence classes of oriented graphs
- A study on oriented relative clique number
- Colored homomorphisms of colored mixed graphs
- On deeply critical oriented graphs
- Light subgraphs of graphs embedded in the plane. A survey
- On clique numbers of colored mixed graphs
- On relative clique number of triangle-free planar colored mixed graphs
- Relative clique number of planar signed graphs
- Pushable chromatic number of graphs with degree constraints
- Homomorphisms of signed graphs: an update
- Oriented cliques and colorings of graphs with low maximum degree
- The relative signed clique number of planar graphs is 8
- Analogues of cliques for \((m,n)\)-colored mixed graphs
- On oriented cliques with respect to push operation
- On the signed chromatic number of some classes of graphs
- On oriented graphs with certain extension properties.
- The complexity of deciding whether a graph admits an orientation with fixed weak diameter
- Outerplanar and planar oriented cliques
- Chromatic number of sparse colored mixed planar graphs
- The chromatic number of oriented graphs
- Analogues of cliques for oriented coloring
- Homomorphisms of Signed Graphs
- Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs
- Homomorphism bounds for oriented planar graphs
- Homomorphisms of 2-edge-colored graphs
- Oriented graph coloring
- On deeply critical oriented cliques
This page was built for publication: On coloring parameters of triangle-free planar \((n, m)\)-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6640959)
